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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067935 Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n)==rep(2) (mod n). 0
1, 2, 4, 5, 10, 14, 20, 22, 25, 26, 34, 38, 44, 46, 50, 58, 62, 74, 82, 86, 94, 100, 106, 110, 118, 122, 134, 140, 142, 146, 158, 166, 178, 182, 185, 194, 202, 206, 214, 218, 220, 226, 254, 260, 262, 274, 278, 298, 302, 308, 314, 326, 334, 346, 350, 358, 362 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

(10^5-1)/9=11+5*2220 hence 5 is in the sequence

LINKS

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

CROSSREFS

Cf. A002275.

Sequence in context: A154318 A008283 A002237 * A228893 A097133 A023165

Adjacent sequences:  A067932 A067933 A067934 * A067936 A067937 A067938

KEYWORD

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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified December 18 16:43 EST 2014. Contains 252168 sequences.