Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024596
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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; listen)
OFFSET

1,3

CROSSREFS

Sequence in context: A141731 A024856 A023869 this_sequence A065375 A070961 A061721

Adjacent sequences: A024593 A024594 A024595 this_sequence A024597 A024598 A024599

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research