login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324320 Terms of 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) that are also octagonal numbers (A000567) with index equal to their largest prime factor. 12
1045, 2465, 2821, 15841, 20501, 34133, 51221, 68101, 89441, 116033, 118405, 162401, 170885, 216545, 300833, 364705, 439301, 472033, 530881, 642181, 687365, 746005, 970145, 976981, 997633, 1104133, 1148245, 1193221, 1231361, 1239061, 1398101, 1654661, 1971541 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
2465 is also a Carmichael number (A002997).
2821 is also a primary Carmichael number (A324316).
See the section on polygonal numbers in Kellner and Sondow 2019.
Subsequence of the special polygonal numbers A324973. - Jonathan Sondow, Mar 27 2019
LINKS
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, #A52 Integers 21 (2021), 21 pp.; arXiv:1902.10672 [math.NT], 2019.
EXAMPLE
A324315(4) = 1045 = 5 * 11 * 19 = 19 * (3 * 19 - 2) = A000567(19), so 1045 is a member.
MATHEMATICA
SD[n_, p_] := If[n < 1 || p < 2, 0, Plus @@ IntegerDigits[n, p]];
LP[n_] := Transpose[FactorInteger[n]][[1]];
ON[n_] := n(3n - 2);
TestS[n_] := (n > 1) && SquareFreeQ[n] && VectorQ[LP[n], SD[n, #] >= # &];
Select[ON@ Prime[Range[100]], TestS[#] &]
CROSSREFS
Sequence in context: A045027 A345514 A345767 * A334012 A344376 A023067
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
More terms from Amiram Eldar, Dec 05 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)