id:A137328 - OEIS Search Results

Search: id:A137328

Displaying 1-1 of 1 results found.

page 1

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
1

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; listen)

	OFFSET	`1,3`
	COMMENT	`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 ?`
	EXAMPLE	`a(6) = p(6)-primorial(2) = 13-6 = 7`
	CROSSREFS	`Cf. A000040, A002110, A136437.` `Adjacent sequences: A137325 A137326 A137327 this_sequence A137329 A137330 A137331` `Sequence in context: A021080 A049764 A136437 this_sequence A140991 A038738 A116647`
	KEYWORD	`easy,nonn`
	AUTHOR	`Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Apr 07 2008`

page 1

Search completed in 0.002 seconds

Last modified January 7 17:35 EST 2009. Contains 152824 sequences.

AT&T Labs Research