OFFSET
1,1
COMMENTS
For d >= 1 define S_d = (terms m in A324315 such that s_p(m) == d (mod p-1) if prime p divides m). Then S_1 is precisely the Carmichael numbers (A002997), S_2 is A324404, S_3 is A324405, and the union of all S_d for d >= 1 is A324315.
Subsequence of the 3-Knödel numbers (A033553). Generally, for d > 1 the terms of S_d that are greater than d form a subsequence of the d-Knödel numbers.
See Kellner and Sondow 2019.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..2000
Bernd C. Kellner and Jonathan Sondow, Power-Sum Denominators, Amer. Math. Monthly 124 (2017), 695-709; arXiv:1705.03857 [math.NT], 2017.
Bernd C. Kellner and Jonathan Sondow, On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-p digits, Integers 21 (2021), Article #A52, 21 pp.; arXiv:1902.10672 [math.NT], 2019-2021.
EXAMPLE
3003 = 3*7*11*13 is squarefree and equals 11010020_3, 11520_7, 2290_11, and 14a0_13 in base p = 3, 7, 11, and 13. Then s_3(3003) = 1+1+1+2 = 5 >= 3, s_7(3003) = 1+1+5+2 = 9 >= 7, s_11(3003) = 2+2+9 = 13 >= 11, and s_13(3003) = 1+4+a = 1+4+10 = 15 >= 13. Also, s_3(3003) = 5 == 3 (mod 2), s_7(3003) = 9 == 3 (mod 6), s_11(3003) = 13 == 3 (mod 10), and s_13(3003) = 15 == 3 (mod 12), so 3003 is a member.
MATHEMATICA
SD[n_, p_] := If[n < 1 || p < 2, 0, Plus @@ IntegerDigits[n, p]];
LP[n_] := Transpose[FactorInteger[n]][[1]];
TestSd[n_, d_] := (n > 1) && (d > 0) && SquareFreeQ[n] && VectorQ[LP[n], SD[n, #] >= # && Mod[SD[n, #] - d, # - 1] == 0 &];
Select[Range[200000], TestSd[#, 3] &]
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Bernd C. Kellner and Jonathan Sondow, Feb 26 2019
STATUS
approved