OFFSET
1,2
COMMENTS
A sequence (y_1, ..., y_k) is strictly superdiagonal iff y_i > i for all i = 1..k.
A number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization.
EXAMPLE
The prime signature of 36 is (2,2), which is not strictly superdiagonal, so 36 is not in the sequence.
The prime signature of 72 is (3,2), which is not strictly superdiagonal, so 72 is not in the sequence.
The prime signature of 108 is (2,3), which is strictly superdiagonal, so 108 is in the sequence.
The prime signature of 216 is (3,3), which is strictly superdiagonal, so 216 is in the sequence.
The terms together with their prime indices begin:
1: {}
4: {1,1}
8: {1,1,1}
9: {2,2}
16: {1,1,1,1}
25: {3,3}
27: {2,2,2}
32: {1,1,1,1,1}
49: {4,4}
64: {1,1,1,1,1,1}
81: {2,2,2,2}
108: {1,1,2,2,2}
121: {5,5}
125: {3,3,3}
128: {1,1,1,1,1,1,1}
169: {6,6}
216: {1,1,1,2,2,2}
243: {2,2,2,2,2}
256: {1,1,1,1,1,1,1,1}
MAPLE
q:= n-> (l-> is(min(l-[$1..nops(l)])>0))(sort(ifactors(n)[2])[.., 2]):
select(q, [$1..2500])[]; # Alois P. Heinz, Sep 23 2025
MATHEMATICA
suppstrQ[mset_]:=And@@Table[mset[[i]]>i, {i, Length[mset]}];
Select[Range[1000], suppstrQ[Last/@If[#==1, {}, FactorInteger[#]]]&]
PROG
(PARI) isok(k) = my(f=factor(k)[, 2]); for (i=1, #f~, if (f[i] <= i, return(0))); return(1); \\ Michel Marcus, Sep 24 2025
(Python)
from sympy import factorint
def ok(n): return all(e > i for i, (p, e) in enumerate(factorint(n).items(), 1))
print([k for k in range(1, 2500) if ok(k)]) # Michael S. Branicky, Sep 30 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 23 2025
STATUS
approved
