|
|
A064799
|
|
Sum of n-th prime number and n-th composite number.
|
|
7
|
|
|
6, 9, 13, 16, 21, 25, 31, 34, 39, 47, 51, 58, 63, 67, 72, 79, 86, 89, 97, 103, 106, 113, 118, 125, 135, 140, 143, 149, 153, 158, 173, 179, 186, 189, 200, 203, 211, 218, 223, 230, 237, 241, 253, 256, 261, 264, 277, 291, 296, 299, 305, 313, 316, 327, 334, 341
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
Ivan Grischenko, ivansasha(AT)mtu-net.ru, private communication.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = prime(n) + composite(n).
|
|
EXAMPLE
|
a(1)=6 because the first prime is 2 and the first composite is 4; 2 + 4 = 6
a(2)=9 because prime(2)=3 and composite(2)=6; 3 + 6 = 9.
|
|
MATHEMATICA
|
Module[{nn=100, cmps}, cmps=Select[Range[nn], CompositeQ]; Total/@Thread[{Prime[Range[ Length[ cmps]]], cmps}]] (* Harvey P. Dale, Mar 31 2024 *)
|
|
PROG
|
(PARI)
nextComp(n)= { if (!isprime(n), return(n)); return(n + 1) }
{ p=1; c=3; for (n=1, 100, p=nextprime(p + 1); c=nextComp(c + 1); print1(p + c, ", ") ) } \\ Harry J. Smith, Sep 25 2009
(Python)
from sympy import prime, composite
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Nov 12 2001
|
|
STATUS
|
approved
|
|
|
|