Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080097
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080097 Fibonacci(n+2)^2 - 1. +0
5
0, 3, 8, 24, 63, 168, 440, 1155, 3024, 7920, 20735, 54288, 142128, 372099, 974168, 2550408, 6677055, 17480760, 45765224, 119814915, 313679520, 821223648, 2149991423, 5628750624, 14736260448, 38580030723, 101003831720 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n), a(n)+1 and a(n)+2 are consecutive members of A049997.

FORMULA

If n is odd, then a(n) = F(n+1)F(n+3) = F(n)F(n+4)-2, else a(n) = F(n)F(n+4) = F(n+1)F(n+3)-2, where F(n) = Fibonacci numbers (A000045).

(1/5) {Lucas(2n+4) - 2(-1)^n - 5}.

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

MATHEMATICA

CoefficientList[Series[(3x+2x^2-x^3)/(1-x^2)(1-2x-2x^2+x^3)), {x, 0, 35}], x]

CROSSREFS

Equals A007598(n+2) - 1. Cf. A064831, A059840.

Sequence in context: A084920 A026556 A096001 this_sequence A096886 A056332 A091588

Adjacent sequences: A080094 A080095 A080096 this_sequence A080098 A080099 A080100

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jan 29 2003

EXTENSIONS

Edited by Ralf Stephan, May 15 2005

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research