|
|
A341643
|
|
The unique strictly superior prime divisor of each number that has one.
|
|
25
|
|
|
2, 3, 5, 3, 7, 5, 11, 13, 7, 5, 17, 19, 5, 7, 11, 23, 13, 7, 29, 31, 11, 17, 7, 37, 19, 13, 41, 7, 43, 11, 23, 47, 17, 13, 53, 11, 19, 29, 59, 61, 31, 13, 11, 67, 17, 23, 71, 73, 37, 19, 11, 13, 79, 41, 83, 17, 43, 29, 11, 89, 13, 23, 31, 47, 19, 97, 11, 101
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
We define a divisor d|n to be strictly superior if d > n/d. Strictly superior divisors are counted by A056924 and listed by A341673.
|
|
LINKS
|
|
|
EXAMPLE
|
The strictly superior divisors of 15 are {5,15}, and A064052(10) = 15, so a(10) = 5.
|
|
MATHEMATICA
|
Join@@Table[Select[Divisors[n], PrimeQ[#]&&#>n/#&], {n, 100}]
|
|
CROSSREFS
|
The inferior version is (largest inferior prime divisor) is A217581.
These divisors (strictly superior prime) are counted by A341642.
a(n) is the unique prime divisor in row n of A341673, for each n in A064052.
A038548 counts superior (or inferior) divisors.
A048098 lists numbers without a strictly superior prime divisor.
A056924 counts strictly superior (or strictly inferior) divisors.
A140271 selects the smallest strictly superior divisor.
A238535 adds up strictly superior divisors.
A341591 counts superior prime divisors.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|