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!)
A024891 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (primes). 0

%I #3 Mar 30 2012 18:56:00

%S 0,0,5,7,11,13,17,19,36,46,50,60,70,74,84,94,131,139,157,171,177,193,

%T 207,221,237,251,310,330,348,360,390,408,424,448,470,486,506,540,625,

%U 653,673,699,739,761,781,803,835,863,891,925,953,975,1104,1136,1180,1214,1244,1270

%N s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (primes).

%K nonn

%O 2,3

%A _Clark Kimberling_

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 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)