OFFSET
1,8
COMMENTS
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
EXAMPLE
The strictly superior prime power divisors of random selected n:
n = 768 2048 5103 6144 8192 8722 9433 9984
----------------------------------------------
32 64 81 128 128 9433 128
64 128 243 256 256 256
128 256 729 512 512
256 512 1024 1024
1024 2048 2048
2048 4096
8192
MATHEMATICA
Table[Length[Select[Divisors[n], PrimePowerQ[#]&&#>n/#&]], {n, 100}]
PROG
(PARI) a(n) = sumdiv(n, d, d^2 > n && isprimepower(d)); \\ Amiram Eldar, Nov 01 2024
CROSSREFS
Positions of zeros (after the first) are A051283.
The inferior version is A333750.
Dominated by A341593 (the weakly superior version).
The version for odd instead of prime divisors is A341594.
The version for squarefree instead of prime divisors is A341595.
The version for prime instead of prime-power divisors is A341642.
The strictly inferior version is A341677.
A000961 lists prime powers.
A001222 counts prime-power divisors.
A005117 lists squarefree numbers.
A140271 selects the smallest strictly superior divisor.
A038548 counts superior (or inferior) divisors.
A056924 counts strictly superior (or strictly inferior) divisors.
A207375 list central divisors.
A341673 lists strictly superior divisors.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Feb 22 2021
STATUS
approved