login
The OEIS is supported by the many generous donors 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; text; internal format)
OFFSET
1,1
LINKS
CROSSREFS
Sequence in context: A024859 A023870 A025099 * A147655 A051072 A051096
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)