cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A324318 Number of terms in A324315 (squarefree integers m > 1 such that if prime p divides m, then the sum of the base p digits of m is at least p) less than 10^n.

This page as a plain text file.
%I A324318 #16 Jun 26 2022 12:58:03
%S A324318 0,0,2,57,636,7048,75150,801931,8350039,86361487
%N A324318 Number of terms in A324315 (squarefree integers m > 1 such that if prime p divides m, then the sum of the base p digits of m is at least p) less than 10^n.
%C A324318 The number of squarefree integers less than 10^n is 0, 6, 61, 608, 6083, 60794, 607926, 6079291, 60792694, 607927124, ... (see A053462).
%H A324318 Bernd C. Kellner and Jonathan Sondow, <a href="https://doi.org/10.4169/amer.math.monthly.124.8.695">Power-Sum Denominators</a>, Amer. Math. Monthly, 124 (2017), 695-709; arXiv:<a href="https://arxiv.org/abs/1705.03857">1705.03857</a> [math.NT], 2017.
%H A324318 Bernd C. Kellner and Jonathan Sondow, <a href="http://math.colgate.edu/~integers/v52/v52.pdf">On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-p digits</a>, #A52 Integers 21 (2021), 21 pp.; arXiv:<a href="https://arxiv.org/abs/1902.10672">1902.10672</a> [math.NT], 2019.
%e A324318 There are two terms of A324315 less than 10^3, namely, 231 and 561, so a(3) = 2.
%Y A324318 Cf. A053462, A324315, A324316, A324317, A324319, A324320, A324369, A324370, A324371, A324404, A324405.
%K A324318 nonn,base,more
%O A324318 1,3
%A A324318 _Bernd C. Kellner_ and _Jonathan Sondow_, Feb 23 2019