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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067942 Let rep(n) be the n-th repunit number; sequence gives values of n such that rep(n) == rep(9) (mod n). 0
1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 15, 16, 18, 20, 21, 24, 25, 30, 32, 33, 36, 39, 40, 45, 48, 50, 55, 60, 63, 64, 72, 73, 75, 80, 90, 96, 99, 100, 101, 105, 111, 117, 120, 125, 128, 137, 144, 150, 153, 160, 164, 165, 171, 180, 192, 195, 200, 207, 222, 225, 231, 240 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

CROSSREFS

Cf. A002275.

Sequence in context: A059519 A163101 A157465 * A130176 A156541 A031143

Adjacent sequences:  A067939 A067940 A067941 * A067943 A067944 A067945

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 05 2002

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 15 05:45 EST 2012. Contains 205694 sequences.