login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095250 a(n) = 11111111... (n times) = (10^n-1)/9 reduced mod n. 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; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

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 * A135521 A176032 A122410

Adjacent sequences:  A095247 A095248 A095249 * A095251 A095252 A095253

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 17 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.