Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059840
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059840 F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045. +0
8
0, 0, 2, 5, 15, 39, 104, 272, 714, 1869, 4895, 12815, 33552, 87840, 229970, 602069, 1576239, 4126647, 10803704, 28284464, 74049690, 193864605, 507544127, 1328767775, 3478759200, 9107509824, 23843770274, 62423800997, 163427632719 (list; graph; listen)
OFFSET

1,3

FORMULA

G.f.: g(x)=(2x^2+x^3-x^4)/((1-x^2)(1-2x-2x^2+x^3)) - Mario Catalani (mario.catalani(AT)unito.it), Jan 28 2003

a(n) = Sum [ F(k)*F(k+2), {k,1,n-2} ]. - Alexander Adamchuk (alex(AT)kolmogorov.com), May 17 2007

CROSSREFS

Cf. A000045, A059248, A064831, A001654, A119996.

Sequence in context: A000962 A118387 A034522 this_sequence A076865 A006649 A094176

Adjacent sequences: A059837 A059838 A059839 this_sequence A059841 A059842 A059843

KEYWORD

nonn

AUTHOR

njas, Feb 26 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research