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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024596 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A014306. 0
0, 1, 3, 2, 4, 3, 6, 11, 19, 18, 30, 29, 48, 45, 74, 66, 108, 87, 142, 230, 373, 372, 603, 600, 972, 964, 1561, 1540, 2493, 2438, 3946, 3802, 6153, 5776, 9346, 8358, 13525, 10939, 17701, 28642, 46345, 46332, 74968, 74934, 121247, 121158, 196039, 195806 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

CROSSREFS

Sequence in context: A024856 A147598 A023869 * A175508 A065375 A070961

Adjacent sequences:  A024593 A024594 A024595 * A024597 A024598 A024599

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 17 14:50 EST 2012. Contains 206050 sequences.