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

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

%S 1,2,4,5,8,10,11,16,20,25,32,35,40,50,55,65,74,77,80,85,95,100,101,

%T 115,125,143,145,155,160,185,200,205,215,235,250,265,275,295,296,305,

%U 335,355,365,395,400,407,410,415,445,455,485,500,505,515,535,545,565,620

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