Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024597
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024597 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 = (primes). +0
1
2, 3, 11, 17, 40, 56, 111, 147, 265, 321, 558, 674, 1141, 1321, 2195, 2571, 4232, 4876, 7971, 8809, 14343, 16081, 26122, 28426, 46113, 49727, 80587, 88083, 142656, 155902, 252409, 271617, 439653, 464867, 752352, 804854, 1302473, 1374265, 2223813, 2340937 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A024859 A023870 A025099 this_sequence A147655 A051072 A051078

Adjacent sequences: A024594 A024595 A024596 this_sequence A024598 A024599 A024600

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research