login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..61.

CROSSREFS

Cf. A002275.

Sequence in context: A064481 A336505 A303704 * A067784 A324107 A018744

Adjacent sequences:  A067936 A067937 A067938 * A067940 A067941 A067942

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre, Mar 05 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 01:01 EST 2022. Contains 350467 sequences. (Running on oeis4.)