The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A067935 Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n)==rep(2) (mod n). 1

%I #16 Jul 03 2019 04:05:52

%S 1,2,4,5,10,14,20,22,25,26,34,38,44,46,50,58,62,74,82,86,94,100,106,

%T 110,118,122,134,140,142,146,158,166,178,182,185,194,202,206,214,218,

%U 220,226,254,260,262,274,278,298,302,308,314,326,334,346,350,358,362

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

%C (10^5-1)/9 = 11+5*2220, hence 5 is in the sequence.

%H Robert Israel, <a href="/A067935/b067935.txt">Table of n, a(n) for n = 1..10000</a>

%p filter:= n -> 10&^n -100 mod (9*n) = 0:

%p select(filter, [$1..400]); # _Robert Israel_, Jul 02 2019

%Y Cf. A002275, A095250 (rep(n) mod n).

%K 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 12 16:52 EDT 2024. Contains 372492 sequences. (Running on oeis4.)