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!)
A000864 Deceptive nonprimes: composite numbers k that divide the repunit R_{k-1}. 3

%I #34 Aug 14 2021 18:52:29

%S 91,259,451,481,703,1729,2821,2981,3367,4141,4187,5461,6533,6541,6601,

%T 7471,7777,8149,8401,8911,10001,11111,12403,13981,14701,14911,15211,

%U 15841,19201,21931,22321,24013,24661,27613,29341,34133

%N Deceptive nonprimes: composite numbers k that divide the repunit R_{k-1}.

%C Francis and Ray call these numbers "deceptive primes".

%C Pseudoprimes to base 10, A005939, not divisible by 3. If k is in the sequence, then (10^k-1)/9 is in the sequence, by Steuerwald's theorem; see A005935. - _Thomas Ordowski_, Apr 10 2016

%C 41041 is the first term that has four prime divisors. - _Altug Alkan_, Apr 10 2016

%H Charles R Greathouse IV, <a href="/A000864/b000864.txt">Table of n, a(n) for n = 1..10000</a>

%H R. Francis and T. Ray, <a href="https://doi.org/10.35834/2000/1203145">The deceptive primes to 2.10^7</a>, Missouri J. Math. Sci. 12 (2000), no. 3, 145-158.

%p select(t -> not isprime(t) and (10&^(t-1) - 1) mod (9*t) = 0, [seq(t,t=3..10^5,2)]); # _Robert Israel_, Apr 10 2016

%o (PARI) p=5;forprime(q=7,1e5,forstep(n=p+2,q-2,2,if(n%5 && Mod(10,9*n)^(n-1)==1,print1(n", ")));p=q) \\ _Charles R Greathouse IV_, Jul 31 2011

%Y Cf. A002275, A005939.

%K nonn

%O 1,1

%A Tim Ray (c268scm(AT)semovm.semo.edu)

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)