login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A067939
Let rep(n) be the n-th repunit number; sequence gives values of n such that rep(n) == rep(6) (mod n).
0
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 22, 24, 25, 30, 32, 40, 41, 42, 44, 48, 50, 60, 64, 66, 75, 78, 80, 84, 88, 96, 100, 102, 110, 111, 114, 120, 125, 132, 138, 150, 156, 160, 168, 174, 176, 186, 192, 200, 202, 210, 220, 222, 240, 246, 250, 258, 264, 271, 282
OFFSET
1,2
CROSSREFS
Cf. A002275.
Sequence in context: A064481 A336505 A303704 * A067784 A324107 A018744
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Mar 05 2002
STATUS
approved