id:A069531 - OEIS Search Results

Search: id:A069531

Displaying 1-1 of 1 results found.

page 1

Smallest positive k such that 10^k + 1 is divisible by n, or 0 if no such number exists.

+0
2

1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 1, 0, 3, 0, 0, 0, 8, 0, 9, 0, 0, 0, 11, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 23, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 29, 0, 30, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 22, 0, 3, 0, 0, 0, 0, 0, 48, 0, 0, 0, 2 (list; graph; listen)

	OFFSET	`1,7`
	COMMENT	`a(n)(<>0) is a divisor of phi(n). If n is a prime with primitive root 10 (cf. A001913) then a(n) = (n-1)/2.`
	EXAMPLE	`a(7) = a(13) = 3 as 1001 is divisible by 7 and 13. a(17) = 8 as 17 divides 100000001 = 10^8 + 1.`
	CROSSREFS	`Cf. A069521 to A069530.` `Cf. A000010, A001913, A002329.` `Sequence in context: A128980 A096693 A083206 this_sequence A035677 A101941 A089313` `Adjacent sequences: A069528 A069529 A069530 this_sequence A069532 A069533 A069534`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 01 2002`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 03 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research