login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024460 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (1, p(1), p(2), ...). 0
1, 2, 5, 8, 18, 28, 53, 73, 130, 170, 294, 352, 595, 715, 1184, 1368, 2248, 2630, 4293, 4943, 8042, 8882, 14422, 16164, 26211, 28523, 46214, 49830, 80694, 88192, 142769, 156029, 252540, 271754, 439792, 465016, 752503, 805011, 1302636, 1374432, 2223986 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

CROSSREFS

Sequence in context: A050872 A086324 A073708 * A039658 A063675 A000943

Adjacent sequences:  A024457 A024458 A024459 * A024461 A024462 A024463

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.