login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064799 Sum of n-th prime number and n-th composite number. 5
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; internal format)
OFFSET

1,1

COMMENTS

a(n) = A000040(n) + A002808(n). [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Dec 13 2009]

REFERENCES

Ivan Grischenko, ivansasha(AT)mtu-net.ru, private communication.

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

FORMULA

a(n) = prime(n)+composite(n)

a(n) = A171639(n+1). [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Dec 13 2009]

EXAMPLE

E.g. a(1)=6 because first prime is 2 and first composite is 4. a(2)=9 because p(2)=3 and c(2)=6. Et cetera.

PROG

(PARI) nextComp(n)= { if (!isprime(n), return(n)); return(n + 1) } { p=1; c=3; for (n=1, 1000, p=nextprime(p + 1); c=nextComp(c + 1); write("b064799.txt", n, " ", p + c) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 25 2009]

CROSSREFS

Sequence in context: A106218 A118521 A095213 * A030499 A181428 A171575

Adjacent sequences:  A064796 A064797 A064798 * A064800 A064801 A064802

KEYWORD

nonn,easy

AUTHOR

Konstantin Knop (Konstantin(AT)Knop.com), Oct 21 2001

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Nov 12 2001

OFFSET changed from 0,1 to 1,1 by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 25 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:13 EST 2012. Contains 205893 sequences.