Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024878
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024878 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 3), t = (F(2), F(3), F(4), ...). +0
1
6, 9, 27, 44, 96, 155, 299, 484, 874, 1414, 2456, 3974, 6736, 10899, 18185, 29424, 48588, 78617, 128933, 208618, 340580, 551070, 896928, 1451260, 2357338, 3814253, 6187383 (list; graph; listen)
OFFSET

2,1

CROSSREFS

Sequence in context: A093153 A115646 A115644 this_sequence A007414 A025493 A054871

Adjacent sequences: A024875 A024876 A024877 this_sequence A024879 A024880 A024881

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 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research