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

%I

%S 1,2,4,5,8,10,16,20,22,25,28,37,40,44,50,52,68,70,76,80,88,92,100,110,

%T 112,116,124,125,130,148,154,164,172,176,188,200,208,212,220,236,244,

%U 250,268,280,284,286,292,316,332,340,356,364,370,388,400,404,412,418

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

%t Select[Range[500],Mod[FromDigits[PadRight[{},#,1]],#]==Mod[1111,#]&] (* _Harvey P. Dale_, Nov 12 2015 *)

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 06:18 EST 2022. Contains 350464 sequences. (Running on oeis4.)