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

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

%S 1,2,4,5,8,10,14,16,20,22,25,26,32,40,44,50,56,64,74,80,88,100,104,

%T 110,125,128,136,140,152,160,176,182,184,185,200,220,224,232,239,248,

%U 250,256,260,296,308,320,328,344,350,352,376,400,404,416,424,440,472,488

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