A377433 Number of non-perfect-powers x in the range prime(n) < x < prime(n+1).
0, 0, 1, 1, 1, 2, 1, 3, 3, 1, 3, 3, 1, 3, 4, 5, 1, 4, 3, 1, 5, 2, 5, 7, 2, 1, 3, 1, 3, 11, 2, 5, 1, 8, 1, 5, 5, 3, 4, 5, 1, 9, 1, 2, 1, 11, 10, 2, 1, 3, 5, 1, 8, 4, 5, 5, 1, 5, 3, 1, 8, 13, 3, 1, 3, 12, 5, 8, 1, 3, 5, 6, 5, 5, 3, 5, 7, 2, 7, 9, 1, 9, 1, 5, 2
Offset: 1
Keywords
Examples
Between prime(4) = 7 and prime(5) = 11 the only non-perfect-power is 10, so a(4) = 1.
Crossrefs
Positions of 1 are latter terms of A029707.
Positions of terms > 1 appear to be A049579.
For prime-powers instead of non-perfect-powers we have A080101.
For non-prime-powers instead of non-perfect-powers we have A368748.
Perfect-powers in the same range are counted by A377432.
A081676 gives the greatest perfect-power <= n.
A377468 gives the least perfect-power > n.
Programs
-
Mathematica
radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1; Table[Length[Select[Range[Prime[n]+1, Prime[n+1]-1],radQ]],{n,100}]
Comments