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!)
A025111 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (primes). 0
3, 5, 17, 25, 56, 76, 147, 177, 321, 389, 674, 784, 1321, 1549, 2571, 2967, 4876, 5390, 8809, 9879, 16081, 17501, 28426, 30656, 49727, 54357, 88083, 96267, 155902, 167768, 271617, 287197, 464867, 497311, 804854, 849218, 1374265, 1446647, 2340937, 2495033, 4037272 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

CROSSREFS

Sequence in context: A263811 A323194 A024867 * A253204 A266165 A281622

Adjacent sequences:  A025108 A025109 A025110 * A025112 A025113 A025114

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 June 26 00:12 EDT 2022. Contains 354870 sequences. (Running on oeis4.)