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

%I

%S 8,12,38,58,126,174,297,381,569,689,979,1167,1591,1825,2372,2700,3408,

%T 3814,4716,5166,6274,6856,8175,8811,10375,11141,12989,13909,16008,

%U 17042,19448,20606,23335,24589,27647,29133,32611,34229,38139,39947,44278,46356,51110

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

%K nonn

%O 1,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 March 20 22:57 EDT 2023. Contains 361392 sequences. (Running on oeis4.)