|
|
A119242
|
|
Least number k such that there are exactly n powerful numbers between k^2 and (k+1)^2.
|
|
8
|
|
|
1, 2, 5, 31, 234, 1822, 3611, 17329, 1511067, 524827, 180469424, 472532614, 78102676912
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Pettigrew gives a(1)-a(6) in table 14. He conjectures that k exists for every n. Surprisingly, a(8) is greater than 10^6, but a(9)=524827. The Mathematica program creates all powerful numbers <= nMax by computing all products of the form x^2 y^3.
Shiu (1980) proved that infinitely many values of k exist for every n. Therefore this sequence is infinite. - Amiram Eldar, Jul 10 2020
|
|
REFERENCES
|
József Sándor, Dragoslav S. Mitrinovic and Borislav Crstici, Handbook of Number Theory I, Springer Science & Business Media, 2005, chapter VI, p. 226.
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 31 because 968, 972 and 1000 are between 961 and 1024.
|
|
MATHEMATICA
|
nMax=10^12; lst={}; Do[lst=Join[lst, i^3 Range[Sqrt[nMax/i^3]]^2], {i, nMax^(1/3)}]; lst=Union[lst]; n=0; k=1; Do[n0=k; While[lst[[k]]<j^2, k++ ]; n1=k; If[n1-n0-1==n, Print[{n, j-1}]; n++ ], {j, Sqrt[nMax]}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|