|
|
A033553
|
|
3-Knödel numbers or D-numbers: numbers m > 3 such that m | k^(m-2)-k for all k with gcd(k, m) = 1.
|
|
21
|
|
|
9, 15, 21, 33, 39, 51, 57, 63, 69, 87, 93, 111, 123, 129, 141, 159, 177, 183, 195, 201, 213, 219, 237, 249, 267, 291, 303, 309, 315, 321, 327, 339, 381, 393, 399, 411, 417, 447, 453, 471, 489, 501, 519, 537, 543, 573, 579, 591, 597, 633, 669, 681, 687, 693, 699, 717, 723, 753, 771, 789, 807, 813, 819
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Also, composite numbers m such that A000010(p^k)=(p-1)*p^(k-1) divides m-3 for every prime power p^k dividing m (cf. A002997).
Properties: (i) All terms are odd. (ii) A prime power p^k with k>1 may divide a term only if p=3 and k=2. (iii) Many terms are divisible by 3. The first term not divisible by 3 is a(2000) = 50963 (cf. A277344). (End)
All terms satisfy the congruence 2^m == 8 (mod m) and thus belong to A015922. Sequence a(n)/3 is nearly identical to A106317, which does not contain the terms 399/3 = 133 and 195/3 = 65. - Gary Detlefs, May 28 2014; corrected by Max Alekseyev, Oct 03 2016
Called "D numbers" by Morrow (1951), in analogy to Carmichael numbers (A002997) that were also known then as "F numbers". Called "C_3 numbers" (and in general "C_k numbers") by Knödel (1953). Makowski (1962/63) proved that there are infinitely many k-Knödel numbers for all k >= 2. The 1-Knödel numbers are the Carmichael numbers (A002997). - Amiram Eldar, Mar 25 2024, Apr 21 2024
|
|
REFERENCES
|
A. Makowski, Generalization of Morrow's D-Numbers, Bull. Belg. Math. Soc. Simon Stevin, Vol. 36 (1962/63), p. 71.
Paulo Ribenboim, The Little Book of Bigger Primes, 2nd ed., Springer, 2004, pp. 102-103.
|
|
LINKS
|
John H. Castillo and Jhony Fernando Caranguay Mainguez, The set of k-units modulo n, Involve, a Journal of Mathematics, Vol. 15, No. 3 (2022), pp. 367-378; arXiv preprint, arXiv:1708.06812 [math.NT], 2017.
Eric Weisstein's World of Mathematics, D-Number.
|
|
MATHEMATICA
|
Select[Range[4, 10^3], Divisible[# - 3, CarmichaelLambda[#]] &] (* Michael De Vlieger, Jul 15 2017 *)
|
|
PROG
|
(PARI) { isA033553(n) = my(p=factor(n)); for(i=1, matsize(p)[1], if( (n-3)%eulerphi(p[i, 1]^p[i, 2]), return(0)); ); 1; } \\ Max Alekseyev, Oct 04 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|