id:A095250 - OEIS Search Results

Search: id:A095250

Displaying 1-1 of 1 results found.

page 1

a(n) = 11111111... (n times) = (10^n-1)/9 reduced mod n.

+0
2

0, 1, 0, 3, 1, 3, 1, 7, 0, 1, 1, 3, 1, 11, 6, 7, 1, 9, 1, 11, 6, 11, 1, 15, 11, 11, 0, 19, 1, 21, 1, 7, 12, 11, 16, 27, 1, 11, 33, 31, 1, 21, 1, 11, 36, 11, 1, 39, 36, 11, 9, 19, 1, 27, 1, 39, 54, 11, 1, 51, 1, 11, 27, 7, 61, 33, 1, 23, 42, 61, 1, 63, 1, 11, 36, 47, 23, 39, 1, 71, 0, 11, 1, 63 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(p) = 1 if p is a prime; a(3^k) = 0.`
	REFERENCES	`Amarnath Murthy, "On the divisors of Smarandache Unary Sequence", Smarandache Notions Journal, 1-2-3, vol. 11, 2000.`
	EXAMPLE	`1111111 mod 7 = 1.`
	CROSSREFS	`Sequence in context: A126212 A066637 A050336 this_sequence A135521 A122410 A082495` `Adjacent sequences: A095247 A095248 A095249 this_sequence A095251 A095252 A095253`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 17 2004`

page 1

Search completed in 0.002 seconds

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research