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

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

%S 3,5,17,25,56,76,136,164,265,319,475,553,776,894,1198,1354,1755,1933,

%T 2443,2685,3316,3586,4352,4682,5605,6029,7119,7613,8878,9422,10892,

%U 11496,13183,13921,15847,16657,18836,19762,22210,23304,26039,27227,30267,31595,34948

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

%K nonn

%O 2,1

%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 June 5 22:25 EDT 2023. Contains 363138 sequences. (Running on oeis4.)