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!)
A025100 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers). 0
6, 8, 25, 28, 59, 68, 129, 148, 249, 277, 454, 491, 728, 790, 1131, 1225, 1650, 1759, 2313, 2436, 3173, 3338, 4197, 4414, 5495, 5732, 7003, 7304, 8737, 9108, 10767, 11219, 13172, 13718, 15997, 16588, 19089, 19714, 22566, 23296, 26463, 27301, 30722, 31686, 35514 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

CROSSREFS

Sequence in context: A053189 A156231 A024860 * A155478 A219191 A107366

Adjacent sequences:  A025097 A025098 A025099 * A025101 A025102 A025103

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 26 22:11 EDT 2022. Contains 357051 sequences. (Running on oeis4.)