|
|
A362983
|
|
Number of prime factors of n (with multiplicity) that are greater than the least.
|
|
1
|
|
|
0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 2, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 0, 1, 1, 1, 2, 0, 1, 1, 1, 0, 2, 0, 1, 1, 1, 0, 1, 0, 2, 1, 1, 0, 3, 1, 1, 1, 1, 0, 2, 0, 1, 1, 0, 1, 2, 0, 1, 1, 2, 0, 2, 0, 1, 2, 1, 1, 2, 0, 1, 0, 1, 0, 2, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,18
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The prime factorization of 360 is 2*2*2*3*3*5, with factors greater than the least 3*3*5, so a(360) = 3.
|
|
MATHEMATICA
|
Table[PrimeOmega[n]-If[n==1, 0, FactorInteger[n][[1, 2]]], {n, 30}]
|
|
CROSSREFS
|
Positions of numbers > 0 are A024619.
Positions of first appearances appear to be A099856.
For "less than greatest" instead of "greater than least" we have A325226.
For multiplicities instead of parts we have A363131.
A363128 counts partitions with more than one non-mode, complement A363129.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|