login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067936 Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n) == rep(3) (mod n). 0
1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 15, 20, 21, 24, 25, 30, 33, 39, 40, 50, 51, 55, 57, 60, 69, 75, 87, 93, 100, 105, 111, 120, 123, 125, 129, 141, 150, 159, 165, 177, 183, 195, 200, 201, 213, 219, 222, 231, 237, 249, 250, 267, 273, 275, 291, 300, 303, 309, 321, 327 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

CROSSREFS

Cf. A002275.

Sequence in context: A070994 A291686 A057197 * A087721 A226244 A140642

Adjacent sequences:  A067933 A067934 A067935 * A067937 A067938 A067939

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 September 22 22:38 EDT 2021. Contains 347609 sequences. (Running on oeis4.)