login
This site is supported by donations to The OEIS 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; internal format)
OFFSET

1,2

CROSSREFS

Cf. A002275.

Sequence in context: A088232 A070994 A057197 * A087721 A140642 A188936

Adjacent sequences:  A067933 A067934 A067935 * A067937 A067938 A067939

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 17 21:13 EST 2012. Contains 206085 sequences.