Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026625
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026625 Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026615. +0
1
1, 1, 2, 4, 7, 13, 21, 36, 58, 96, 155, 253, 409, 664, 1074, 1740, 2815, 4557, 7373, 11932, 19306, 31240, 50547, 81789, 132337, 214128, 346466, 560596, 907063, 1467661, 2374725, 3842388, 6217114, 10059504, 16276619, 26336125 (list; graph; listen)
OFFSET

0,3

FORMULA

For n>1, a(n) = Fibonacci(n-1) + Lucas(n) - [3+(-1)^n]/2. - R. Stephan, May 13 2004

CROSSREFS

Adjacent sequences: A026622 A026623 A026624 this_sequence A026626 A026627 A026628

Sequence in context: A037032 A090752 A051058 this_sequence A026691 A018150 A019471

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 May 16 22:57 EDT 2008. Contains 139737 sequences.


AT&T Labs Research