login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A378699
Number of proper prime powers between powerful numbers that are not prime powers.
1
7, 2, 1, 0, 3, 1, 0, 0, 0, 2, 1, 2, 0, 0, 0, 0, 0, 2, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 3, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0
OFFSET
1,1
COMMENTS
Within the sequence S = A001694 of powerful numbers, we have either proper prime powers k (in A246547) and numbers m that are not prime powers (in A286708). This sequence is the number of k between m.
LINKS
EXAMPLE
We partition S = A001694 by numbers m in A286708 (in brackets) and derive the following irregular table:
4, 8, 9, 16, 25, 27, 32, [36]; hence a(1) = 7,
49, 64, [72]; a(2) = 2,
81, [100]; a(3) = 1,
[108]; a(4) = 0,
121, 125, 128, [144]; a(5) = 3,
169, [196]; a(6) = 1,
[200]; a(7) = 0,
[216]; a(8) = 0,
[225]; a(9) = 0,
243, 256, [288]; a(10) = 2, etc.
MATHEMATICA
nn = 2^16; s = Union@ Flatten@ Table[a^2*b^3, {b, Surd[nn, 3]}, {a, Sqrt[nn/b^3]}]; -1 + Length /@ TakeList[s, Differences@ Rest@ Position[s, _?(! PrimePowerQ[#] &) ][[All, 1]] ]
CROSSREFS
KEYWORD
nonn,easy,new
AUTHOR
Michael De Vlieger, Dec 04 2024
STATUS
approved