|
%I #19 Jan 12 2023 10:15:29
%S 6601,62745,399001,399001,656601,656601,656601,2508013
%N 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).
%C 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
%H R. G. E. Pinch, <a href="https://doi.org/10.1090/S0025-5718-1993-1202611-7">The Carmichael numbers up to 10^15</a>, Math. Comp. 61 (1993), no. 203, 381-391.
%Y Cf. A002997, A359729.
%K nonn,more,uned
%O 1,1
%A _Abigail S. Chen_, Jul 24 2018
%E 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
|
