The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006208 Generalized Fibonacci numbers A_{n,3}.
(Formerly M0148)
7

%I M0148 #31 Oct 01 2018 08:20:00

%S 1,1,0,1,0,2,1,3,2,6,4,9,8,18,16,32,32,61,64,115,128,224,258,431,520,

%T 850,1050,1673,2128,3328,4320,6649,8788,13366,17920,26957,36610,54634,

%U 74932,111057,153656,226514,315616,463243,649334,949823,1337984,1951760

%N Generalized Fibonacci numbers A_{n,3}.

%C Bau-Sen Du's [1985/2007] Table 1, p. 6, has this sequence as the 4th column. - _Jonathan Vos Post_, Jun 18 2007

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Bau-Sen Du, <a href="http://arXiv.org/abs/0706.2297">The Minimal Number of Periodic Orbits of Periods Guaranteed in Sharkovskii's Theorem</a>. Bull. Austral. Math. Soc. 31(1985), 89-103. Corrigendum: 32 (1985), 159.

%H Bau-Sen Du, <a href="http://arXiv.org/abs/0706.2421">A Simple Method Which Generates Infinitely Many Congruence Identities</a>, Fib. Quart. 27 (1989), 116-124.

%t max = 50;

%t Do[Do[b1[1][j, n] = 0; b1[2][j, n] = 1; b2[1][j, n] = b2[2][j, n] = 0, {j, n}]; b2[1][n, n] = b2[2][n, n] = 1, {n, max}];

%t Do[Do[Do[b1[k][j, n] = b1[k-2][1, n] + b1[k-2][j+1, n]; b2[k][j, n] = b2[k - 2][1, n] + b2[k-2][j+1, n], {j, n-1}]; b1[k][n, n] = b1[k-2][1, n] + b1[k-1][n, n]; b2[k][n, n] = b2[k-2][1, n] + b2[k-1][n, n], {n, max}], {k, 3, max}];

%t phin[n_] := Table[b2[m][n, n] + 2 Sum[If[m+2-2j > 0, b1[m+2-2j][j, n], 0], {j, n}], {m, max}];

%t MT[s_] := Table[DivisorSum[n, MoebiusMu[#] s[[n/#]]&]/n, {n, Length[s]}];

%t MT[phin[3]] (* _Jean-François Alcover_, Oct 01 2018, after _Max Alekseyev_ in A006207 *)

%o (PARI) \\ implementation of MT() and phin() is given in A006207

%o MT(phin(3)) \\ sequence A_{n,3} \\ _Max Alekseyev_, Feb 23 2012

%Y Cf. A006206 (A_{n,1}), A006207 (A_{n,2}), A006209 (A_{n,4}), A130628 (A_{n,5}), A208092 (A_{n,6}), A006210 (D_{n,2}), A006211 (D_{n,3}), A094392.

%K nonn

%O 1,6

%A _N. J. A. Sloane_

%E arxiv URL replaced with non-cached version, and duplicate of a reference removed, by _R. J. Mathar_, Oct 30 2009

%E Terms a(32) onward from _Max Alekseyev_, Feb 23 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 12:18 EDT 2024. Contains 372630 sequences. (Running on oeis4.)