id:A066936 - OEIS Search Results

Search: id:A066936

Displaying 1-1 of 1 results found.

page 1

prime(n) == 1 (mod phi(n)) where prime(n)=A000040(n) is the n-th prime and phi(n)=A000010(n) is the Euler totient function.

+0
3

1, 2, 3, 4, 6, 10, 11, 12, 14, 18, 21, 24, 30, 38, 42, 46, 67, 84, 87, 110, 121, 136, 159, 279, 306, 378, 428, 439, 516, 662, 682, 726, 1046, 1110, 1199, 1410, 1687, 2160, 2244, 2438, 2450, 2612, 2614, 2654, 3270, 3477, 3829, 7107, 7178, 8682, 9260 (list; graph; listen)

	OFFSET	`1,2`
	MATHEMATICA	`Select[Range[1, 10000], Mod[Prime[ # ]-1, EulerPhi[ # ]]==0&]`
	CROSSREFS	`Sequence in context: A094859 A122397 A047417 this_sequence A067027 A005457 A005453` `Adjacent sequences: A066933 A066934 A066935 this_sequence A066937 A066938 A066939`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 24 2002`
	EXTENSIONS	`Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 27 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research