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

%I

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

%T 112,125,128,130,146,148,154,160,170,176,190,200,202,205,208,220,230,

%U 250,256,274,280,286,290,310,320,352,364,370,400,410,430,440,442,448,470

%N Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(10) (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 23 23:53 EDT 2022. Contains 353993 sequences. (Running on oeis4.)