A317247 Let E(n,k) denote the k-th smallest Carmichael number such that there are n distinct Carmichael numbers: {x(1), x(2), ..., x(n)} where x_i < E_(n,k), such that for any integer i: 1 <= i <= n, x(i) is a quadratic residue of E(n,k).

6601, 62745, 399001, 399001, 656601, 656601, 656601, 2508013

Offset

1,1

Comments

This may be a (inconsistent) way of picking the n-th occurrence of n in A359729. But apparently there is no 5th occurrence of 5, no 10th occurrence of 10 in A359729: 6601, 62745, 115921, 8719309, ?, 1615681, 1857241, 5444489, 10606681, ?, ... - R. J. Mathar, Jan 12 2023

Links

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

R. G. E. Pinch, The Carmichael numbers up to 10^15, Math. Comp. 61 (1993), no. 203, 381-391.

Crossrefs

Cf. A002997, A359729.

Sequence in context: A252637 A164971 A214434 * A290281 A178213 A237320

Adjacent sequences: A317244 A317245 A317246 * A317248 A317249 A317250

Keyword

nonn,more,uned

Author

Abigail S. Chen, Jul 24 2018

Extensions

This entry was created 6 months ago, but apparently the author forgot to click the "Submit" button. The definition is not clear to me, so I'm marking it as "uned" and approving it in the hope that someone can say exactly what the definition is. An example or two would be helpful. - N. J. A. Sloane, Jan 30 2019

Status

approved