Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024874
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024874 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 = (F(2), F(3), F(4), ...). +0
1
4, 6, 19, 31, 70, 113, 223, 361, 662, 1071, 1880, 3042, 5194, 8404, 14093, 22803, 37786, 61139, 100509, 162627, 265932, 430287, 701120, 1134436, 1844096, 2983810, 4842711, 7835671 (list; graph; listen)
OFFSET

2,1

CROSSREFS

Sequence in context: A013160 A034189 A024697 this_sequence A095383 A116383 A026521

Adjacent sequences: A024871 A024872 A024873 this_sequence A024875 A024876 A024877

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research