Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059727
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059727 Fibonacci(n)*(Fibonacci(n)+1). +0
2
0, 2, 2, 6, 12, 30, 72, 182, 462, 1190, 3080, 8010, 20880, 54522, 142506, 372710, 975156, 2552006, 6679640, 17484942, 45771990, 119825862, 313697232, 821252306, 2150037792, 5628825650, 14736381842, 38580227142, 101004149532, 264431978670 (list; graph; listen)
OFFSET

0,2

REFERENCES

L. Euler, Observationes analyticae, reprinted in: Opera Omnia. Teubner, Leipzig, 1911, Series (1), Vol. 15, p. 54.

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,200

G. E. Andrews, Three aspects of partitions

Eric Weisstein's World of Mathematics, Trinomial Coefficient

FORMULA

G.f.: 2x(1-2x-x^2+x^3)/((1+x)(1-3x+x^2)(1-x-x^2)).

Fib(n) + (1/5)[Lucas(2n) - 2(-1)^n].

PROGRAM

(PARI) a(n)=2*binomial(fibonacci(n)+1, 2)

(PARI) { for (n=0, 200, f=fibonacci(n); write("b059727.txt", n, " ", f*(f + 1)); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 29 2009]

CROSSREFS

Sequence in context: A052994 A088219 A027375 this_sequence A103872 A159322 A049313

Adjacent sequences: A059724 A059725 A059726 this_sequence A059728 A059729 A059730

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Feb 09 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research