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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137330 a(n) = primorial(k)-p(n), where p(n) is n-th prime number; k is smallest number for which p(n)<=primorial(k). 0
0, 3, 1, 23, 19, 17, 13, 11, 7, 1, 179, 173, 169, 167, 163, 157, 151, 149, 143, 139, 137, 131, 127, 121, 113, 109, 107, 103, 101, 97, 83, 79, 73, 71, 61, 59, 53, 47, 43, 37, 31, 29, 19, 17, 13, 11, 2099, 2087, 2083, 2081, 2077, 2071, 2069, 2059, 2053, 2047, 2041 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Does each prime number appear in this sequence at least once ?

EXAMPLE

a(6) = primorial(3) - p(6) = 30-13 = 17

CROSSREFS

Cf. A000040, A002110, A136437.

Sequence in context: A190962 A010291 A027477 * A138654 A175289 A072271

Adjacent sequences:  A137327 A137328 A137329 * A137331 A137332 A137333

KEYWORD

easy,nonn

AUTHOR

Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Apr 07 2008

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 01:31 EST 2012. Contains 205860 sequences.