login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..40.

CROSSREFS

Sequence in context: A024859 A023870 A025099 * A147655 A051072 A051096

Adjacent sequences:  A024594 A024595 A024596 * A024598 A024599 A024600

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 05:56 EST 2021. Contains 349470 sequences. (Running on oeis4.)