|
|
A375136
|
|
Number of maximal strictly increasing runs in the weakly increasing prime factors of n.
|
|
2
|
|
|
0, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 4, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 2, 2, 1, 1, 1, 4, 4, 1, 1, 2, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
For n > 1, this is one more than the number of adjacent equal terms in the multiset of prime factors of n.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The prime factors of 540 are {2,2,3,3,3,5}, with maximal strictly increasing runs ({2},{2,3},{3},{3,5}), so a(540) = 4.
|
|
MATHEMATICA
|
Table[Length[Split[Flatten[ConstantArray@@@FactorInteger[n]], Less]], {n, 100}]
|
|
CROSSREFS
|
For sum of prime indices we have A374706.
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|