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

%I

%S 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,

%T 66,75,78,80,84,88,96,100,102,110,111,114,120,125,132,138,150,156,160,

%U 168,174,176,186,192,200,202,210,220,222,240,246,250,258,264,271,282

%N Let rep(n) be the n-th repunit number; sequence gives values of n such that rep(n) == rep(6) (mod n).

%Y Cf. A002275.

%K easy,nonn

%O 1,2

%A _Benoit Cloitre_, Mar 05 2002

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 12:42 EDT 2022. Contains 354114 sequences. (Running on oeis4.)