id:A056968 - OEIS Search Results

Search: id:A056968

Displaying 1-1 of 1 results found.

page 1

10^(n-1) modulo n.

+0
2

0, 0, 1, 0, 0, 4, 1, 0, 1, 0, 1, 4, 1, 10, 10, 0, 1, 10, 1, 0, 16, 10, 1, 16, 0, 10, 19, 20, 1, 10, 1, 0, 1, 10, 25, 28, 1, 10, 22, 0, 1, 40, 1, 32, 10, 10, 1, 16, 8, 0, 49, 12, 1, 46, 45, 24, 43, 10, 1, 40, 1, 10, 37, 0, 55, 10, 1, 48, 31, 20, 1, 64, 1, 10, 25, 12, 67, 4, 1, 0, 73, 10, 1 (list; graph; listen)

	OFFSET	`1,6`
	FORMULA	`If n is of form 2^i*5^j then a(n)=0, otherwise a(n)=10^(n-1)+n-A053041(n)`
	EXAMPLE	`a(6)=4 since 100000=6*16666+4`
	CROSSREFS	`Cf. A003592, A053041, A056969.` `Sequence in context: A117411 A161739 A094924 this_sequence A035253 A070432 A010639` `Adjacent sequences: A056965 A056966 A056967 this_sequence A056969 A056970 A056971`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jul 20 2000`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research