Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024872
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024872 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 2), t = (Fibonacci numbers). +0
1
2, 4, 12, 19, 43, 70, 138, 223, 409, 662, 1162, 1880, 3210, 5194, 8710, 14093, 23353, 37786, 62118, 100509, 164355, 265932, 433316, 701120, 1139714, 1844096, 2992960, 4842711, 7851463, 12703934, 20582546, 33303259, 53932317, 87264322 (list; graph; listen)
OFFSET

2,1

CROSSREFS

Sequence in context: A064361 A064407 A052289 this_sequence A129021 A090922 A056228

Adjacent sequences: A024869 A024870 A024871 this_sequence A024873 A024874 A024875

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 03 2000

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 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research