id:A068958 - OEIS Search Results

Search: id:A068958

Displaying 1-1 of 1 results found.

page 1

Smallest value of k such that 10^k + 1 == 0 mod p(n), where p(n) is the n-th prime; or 0 if no such k exists.

+0
1

3, 1, 3, 8, 9, 11, 14, 0, 0, 0, 0, 23, 0, 29, 30, 0, 0, 4, 0, 0, 22, 48, 2, 17, 0, 54, 56, 21, 65, 4, 23, 74, 0, 39, 0, 83, 0, 89, 90, 0, 96, 49, 0, 15, 111, 0, 114, 116, 0, 15, 25, 128, 131, 134, 0, 0, 14, 0, 73, 0, 0, 156, 0, 55, 168, 0, 58, 16, 0, 183, 93, 189, 191, 194, 0, 100 (list; graph; listen)

	OFFSET	`4,1`
	EXAMPLE	`a(1) = 3 as the fourth prime 7 divides 1001.`
	CROSSREFS	`Sequence in context: A046544 A011088 A156368 this_sequence A087000 A010282 A119265` `Adjacent sequences: A068955 A068956 A068957 this_sequence A068959 A068960 A068961`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 01 2002`
	EXTENSIONS	`More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 03 2003`

page 1

Search completed in 0.002 seconds

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.

AT&T Labs Research