login
A341591
Number of superior prime divisors of n.
29
0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1
OFFSET
1
COMMENTS
We define a divisor d|n to be superior if d >= n/d. Superior divisors are counted by A038548 and listed by A161908.
All terms are binary numbers.
LINKS
EXAMPLE
The sequence of sets of superior prime divisors of each positive integer begins: {}, {2}, {3}, {2}, {5}, {3}, {7}, {}, {3}, {5}, {11}, {}, {13}, {7}, {5}, {}, {17}, {}, {19}, {5}, ...
MATHEMATICA
Table[Length[Select[Divisors[n], PrimeQ[#]&&#>=n/#&]], {n, 100}]
a[n_] := Count[FactorInteger[n][[;; , 1]], _?(#^2 >= n &)]; a[1] = 0; Array[a, 100] (* Amiram Eldar, Nov 01 2024 *)
PROG
(PARI) a(n) = #select(x -> (x^2 >= n), factor(n)[, 1]); \\ Amiram Eldar, Nov 01 2024
CROSSREFS
Positions of ones are A063538.
Positions of zeros are A063539.
The inferior version is A063962.
The strictly inferior version is A333806.
The version for squarefree instead of prime divisors is A341592.
The version for prime power instead of prime divisors is A341593.
Dominates A341642 (the strictly superior version).
The version for odd instead of prime divisors is A341675.
The unique superior prime divisors of the positive positions are A341676.
A001221 counts prime divisors, with sum A001414.
A033677 selects the smallest superior divisor.
A038548 counts superior (or inferior) divisors.
A056924 counts strictly superior (or strictly inferior) divisors.
A161908 lists superior divisors.
A207375 list central divisors.
- Strictly Inferior: A060775, A333805, A341596, A341674.
Sequence in context: A360123 A211487 A101040 * A306453 A175629 A109720
KEYWORD
nonn
AUTHOR
Gus Wiseman, Feb 19 2021
STATUS
approved