This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059728 a(0)=3; thereafter, a(n) = A002426(n+1) + Fibonacci(n-1)*(Fibonacci(n-1) + 1). 1
 3, 3, 9, 21, 57, 153, 423, 1179, 3321, 9415, 26843, 76869, 220951, 637107, 1842129, 5339133, 15507641, 45127965, 131548859, 384059009, 1122835671, 3286907517, 9633053985, 28262033613, 82998088607, 243963263943, 717698981853, 2112976735749 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 G. E. Andrews, Three aspects of partitions, SÃ©minaire Lotharingien de Combinatoire, B25f (1990), 1 p. L. Euler, (E326) Observationes analyticae, also reprinted in: Opera Omnia. Teubner, Leipzig, 1911, Series (1), Vol. 15, p. 54. EXAMPLE a(6) = F_5*(F_5+1) + A002426(7) = 30 + 393 = 423. MATHEMATICA b[n_] := If[n < 0, 0, 3^n Hypergeometric2F1[1/2, -n, 1, 4/3]];  Table[b[n + 1] + Fibonacci[n - 1]*(1 + Fibonacci[n - 1]), {n, 0, 50}] (* G. C. Greubel, Feb 27 2017 *) PROG (MAGMA) P:=PolynomialRing(Integers()); [Max(Coefficients((1+x+x^2)^(n+1)))+(Fibonacci(n-1)*(Fibonacci(n-1)+1)): n in [0..30]]; // Vincenzo Librandi, Dec 24 2016 CROSSREFS Sequence in context: A206492 A007683 A316220 * A257180 A184694 A215885 Adjacent sequences:  A059725 A059726 A059727 * A059729 A059730 A059731 KEYWORD nonn AUTHOR N. J. A. Sloane, Feb 09 2001 STATUS approved

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

Last modified January 17 06:41 EST 2019. Contains 319207 sequences. (Running on oeis4.)