cp's OEIS Frontend

A324458 Numbers m > 1 such that every prime divisor p of m satisfies s_p(m) = p.

%I A324458 #27 Oct 05 2024 18:12:05
%S A324458 45,325,405,637,891,1729,2821,3751,4961,6517,7381,8125,8281,10625,
%T A324458 13357,21141,26353,28033,29341,31213,33125,35443,46657,47081,58621,
%U A324458 65341,74431,78625,81289,94501,98125,99937,123823,146461,231601,236321,252601,254221,294409
%N A324458 Numbers m > 1 such that every prime divisor p of m satisfies s_p(m) = p.
%C A324458 The function s_p(m) gives the sum of the base-p digits of m.
%C A324458 The sequence contains the primary Carmichael numbers A324316.
%C A324458 Being a subsequence of A324460, a term m has the following properties:
%C A324458 m must have at least 2 prime factors. If m = p1^e1 * p2^e2 with two primes p1 and p2, then e1 + e2 >= 3.
%C A324458 Each prime factor p of m satisfies the inequalities p < m^(1/(ord_p(m)+1)) <= sqrt(m), where ord_p(m) gives the maximum exponent e such that p^e divides m.
%C A324458 In the terminology of A324460, the prime factorization of m equals a strict s-decomposition of m.
%C A324458 See Kellner 2019.
%C A324458 a(n) is squarefree iff a(n) is a primary Carmichael number A324316. - _Jonathan Sondow_, Mar 16 2019
%H A324458 Amiram Eldar, <a href="/A324458/b324458.txt">Table of n, a(n) for n = 1..1000</a> (terms 1..117 from Bernd C. Kellner)
%H A324458 Bernd C. Kellner, <a href="https://doi.org/10.5281/zenodo.10963985">On primary Carmichael numbers</a>, Integers 22 (2022), Article #A38, 39 pp.; arXiv:<a href="https://arxiv.org/abs/1902.11283">1902.11283</a> [math.NT], 2019.
%H A324458 Bernd C. Kellner and Jonathan Sondow, <a href="https://doi.org/10.5281/zenodo.10816833">On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-p digits</a>, Integers 21 (2021), Article #A52, 21 pp.; arXiv:<a href="https://arxiv.org/abs/1902.10672">1902.10672</a> [math.NT], 2019.
%e A324458 The number 45 has the prime factors 3 and 5. Since s_3(45) = 3 and s_5(45) = 5, 45 is a member.
%t A324458 s[n_, p_] := If[n < 1 || p < 2, 0, Plus @@ IntegerDigits[n, p]];
%t A324458 f[n_] := AllTrue[Transpose[FactorInteger[n]][[1]], s[n, #] == # &];
%t A324458 Select[Range[10^7], f[#] &]
%Y A324458 Subsequence is A324316. Subsequence of A324457, A324459, and A324460.
%Y A324458 Cf. A324455, A324456.
%K A324458 nonn,base
%O A324458 1,1
%A A324458 _Bernd C. Kellner_, Feb 28 2019