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!)
A067936 Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n) == rep(3) (mod n). 0

%I #6 Mar 30 2012 18:38:52

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

%T 75,87,93,100,105,111,120,123,125,129,141,150,159,165,177,183,195,200,

%U 201,213,219,222,231,237,249,250,267,273,275,291,300,303,309,321,327

%N Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n) == rep(3) (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 April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)