A289338 Composite numbers (pseudoprimes) n, that are not Carmichael numbers, such that A000670(n) == 1 (mod n).

169, 885, 2193, 8905, 22713

Offset

1,1

Comments

I. J. Good proved that A000670(n) == A000670(m) (mod p) for all primes p, and n == m (mod p-1). Therefore the congruence A000670(n) == 1 (mod n) holds for all primes and Carmichael numbers. This sequence consist of the other composite numbers for which the congruence holds.

Links

Table of n, a(n) for n=1..5.

I. J. Good, The number of orderings of n candidates when ties are permitted, Fibonacci Quarterly, Vol. 13 (1975), pp. 11-18.

Mathematica

a[0] = 1; a[n_] := a[n] = Sum[Binomial[n, k]*a[n - k], {k, 1, n}]; carmichaelQ[n_]:=(Mod[n, CarmichaelLambda[n]] == 1); seqQ[n_] := !PrimeQ[n] && !carmichaelQ[n] && Divisible[a[n]-1, n]; Select[Range[2, 500], seqQ]

Crossrefs

Cf. A000670, A002997, A289337.

Sequence in context: A120904 A038596 A250988 * A256979 A293477 A264304

Adjacent sequences: A289335 A289336 A289337 * A289339 A289340 A289341

Keyword

nonn,more

Author

Amiram Eldar, Jul 02 2017

Status

approved