A121912 -id:A121912 - cp's OEIS frontend

A121014 Nonprime terms in A121912.

1, 6, 9, 10, 15, 18, 30, 33, 45, 55, 90, 91, 99, 165, 246, 259, 370, 385, 451, 481, 495, 505, 561, 657, 703, 715, 909, 1035, 1045, 1105, 1233, 1626, 1729, 2035, 2409, 2465, 2821, 2981, 3333, 3367, 3585, 4005, 4141, 4187, 4521, 4545, 5005, 5461, 6533, 6541

Offset: 1

N. J. A. Sloane, Sep 06 2006

Theorem: If both numbers q and 2q-1 are primes (q is in the sequence A005382) and n=q*(2q-1) then 10^n == 10 (mod n) (n is in the sequence A121014) iff q<5 or mod(q, 20) is in the set {1, 7, 19}. 6,15,91,703,12403,38503,79003,188191,269011,... are such terms. A005939 is a subsequence of this sequence. - Farideh Firoozbakht, Sep 15 2006

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A005382, A005939, A121014, A121912.

Select[Range[10^4], ! PrimeQ[ # ] && PowerMod[10, #, # ] == Mod[10, # ] &] (* Ray Chandler, Sep 06 2006 *)

for(n=1,7000,if(!isprime(n),k=10^n;if((k-10)%n==0,print1(n,",")))) \\ Klaus Brockhaus, Sep 06 2006

Theorem: If both numbers q and 2q-1 are primes and n=q*(2q-1) then 10^n == 10 (mod n) (n is in the sequence) iff q<5 or mod(q, 20) is in the set {1, 7, 19}. - Farideh Firoozbakht, Sep 11 2006

Extended by Ray Chandler and Klaus Brockhaus, Sep 06 2006

A005939 Pseudoprimes to base 10.

Original entry on oeis.org

9, 33, 91, 99, 259, 451, 481, 561, 657, 703, 909, 1233, 1729, 2409, 2821, 2981, 3333, 3367, 4141, 4187, 4521, 5461, 6533, 6541, 6601, 7107, 7471, 7777, 8149, 8401, 8911, 10001, 11111, 11169, 11649, 12403, 12801, 13833, 13981, 14701, 14817, 14911, 15211

Offset: 1

N. J. A. Sloane

nonn

This sequence is a subsequence of A121014 & A121912. In fact the terms are composite terms n of these sequences such that gcd(n,10)=1. Theorem: If both numbers q & 2q-1 are primes(q is in the sequence A005382) and n=q*(2q-1) then 10^(n-1) == 1 (mod n) (n is in the sequence A005939) iff mod(q, 20) is in the set {1, 7, 19}. 91,703,12403,38503,79003,188191,269011,... are such terms. - Farideh Firoozbakht, Sep 15 2006
Composite numbers n such that 10^(n-1) == 1 (mod n). - Michel Lagneau, Feb 18 2012
Composite numbers n such that the number of digits of the period of 1/n divides n-1. - Davide Rotondo, Dec 16 2020

R. K. Guy, Unsolved Problems in Number Theory, A12.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..1000
C. Pomerance & N. J. A. Sloane, Correspondence, 1991
Index entries for sequences related to pseudoprimes

Cf. A001567 (pseudoprimes to base 2), A005382, A121014, A121912.

Select[Range[15300], ! PrimeQ[ # ] && PowerMod[10, (# - 1), # ] == 1 &] (* Farideh Firoozbakht, Sep 15 2006 *)

cp's OEIS Frontend

A121014 Nonprime terms in A121912.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions