id:A066674 - OEIS Search Results

Search: id:A066674

Displaying 1-1 of 1 results found.

page 1

Least number m such that Phi[m]=A000010(m) is divisible by the n-th prime.

+0
7

3, 7, 11, 29, 23, 53, 103, 191, 47, 59, 311, 149, 83, 173, 283, 107, 709, 367, 269, 569, 293, 317, 167, 179, 389, 607, 619, 643, 1091, 227, 509, 263, 823, 557, 1193, 907, 1571, 653, 2339, 347, 359, 1087, 383, 773, 3547, 797, 2111, 2677, 5449, 2749, 467 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Is this a duplicate of A035095? [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 13 2008]`
	FORMULA	`a[n] = Min{m : Mod[Phi[m], p(n)] = 0} = Min{m :Mod[A000010(m), A000040(n)] = 0}`
	EXAMPLE	`All terms seem to be primes of the form a[n]=k*p[n]+1 with various vaues of k.`
	CROSSREFS	`Cf. A000010, A000040, A066675-A066678.` `Cf. A035095.` `Sequence in context: A093361 A051202 A035095 this_sequence A125878 A126112 A156210` `Adjacent sequences: A066671 A066672 A066673 this_sequence A066675 A066676 A066677`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Dec 19 2001`
	EXTENSIONS	`a(2) corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 13 2008`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research