login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Sequence in context: A024859 A023870 A025099 * A147655 A051072 A051096

Adjacent sequences:  A024594 A024595 A024596 * A024598 A024599 A024600

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.