This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A137328 a(n) = p(n)- primorial(k), where p(n) is n-th prime number, k is greatest number for which primorial(k)<=p(n). 0
 0, 1, 3, 1, 5, 7, 11, 13, 17, 23, 1, 7, 11, 13, 17, 23, 29, 31, 37, 41, 43, 49, 53, 59, 67, 71, 73, 77, 79, 83, 97, 101, 107, 109, 119, 121, 127, 133, 137, 143, 149, 151, 161, 163, 167, 169, 1, 13, 17, 19, 23, 29, 31, 41, 47, 53, 59, 61, 67, 71, 73, 83, 97, 101, 103, 107, 121 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Conjecture : Each prime number appears in this sequence at least once. Is there any general asymptotic formula for appearance of p(n) in this sequence ? LINKS EXAMPLE a(6) = p(6)-primorial(2) = 13-6 = 7 CROSSREFS Cf. A000040, A002110, A136437. Sequence in context: A021080 A049764 A136437 * A140991 A302191 A261712 Adjacent sequences:  A137325 A137326 A137327 * A137329 A137330 A137331 KEYWORD easy,nonn AUTHOR Ctibor O. Zizka, Apr 07 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 17 04:58 EDT 2019. Contains 327119 sequences. (Running on oeis4.)