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

%I #9 Jul 17 2019 04:43:53

%S 16,24,68,84,158,180,289,330,474,534,735,810,1072,1158,1474,1586,1958,

%T 2093,2543,2697,3238,3403,4013,4208,4896,5128,5918,6164,7046,7337,

%U 8311,8645,9717,10097,11269,11691,12996,13443,14891,15352,16909,17422,19104,19674,21478

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

%Y Cf. A002808 (composite numbers).

%K nonn

%O 1,1

%A _Clark Kimberling_

%E a(26) corrected by _Sean A. Irvine_, Jul 17 2019

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 25 13:02 EDT 2024. Contains 371969 sequences. (Running on oeis4.)