OFFSET
0,2
COMMENTS
Is this sequence strictly increasing?
From David Consiglio, Jr., Feb 20 2025: (Start)
The answer to the question above is: no, a(21) < a(20). And all subsequent odd indexed terms are lower than their even predecessors.
All terms must be a product of x primes (with multiplicity) to the y power where x-y = n and x mod y = 0. There are very few combinations of numbers that meet these criteria, so checking all of them to find the minimum outcome is quite fast.
Example --> n=5
6 primes to the 1 power --> 6 distinct primes
2*3*5*7*11*13 = 30030
7 primes to the 2 power -- disallowed (5 mod 2 = 1)
8 primes to the 3 power -- disallowed (4 mod 3 = 1)
9 primes to the 4 power -- disallowed (9 mod 4 = 1)
10 primes to the 5 power --> 2 distinct primes
2*2*2*2*2*3*3*3*3*3 = 7776
The minimum value is 7776 and thus a(5) = 7776. (End)
LINKS
David Consiglio, Jr., Table of n, a(n) for n = 0..100
David Consiglio, Jr., Python program
EXAMPLE
The terms together with their prime indices begin:
1: {}
6: {1,2}
30: {1,2,3}
210: {1,2,3,4}
900: {1,1,2,2,3,3}
7776: {1,1,1,1,1,2,2,2,2,2}
27000: {1,1,1,2,2,2,3,3,3}
279936: {1,1,1,1,1,1,1,2,2,2,2,2,2,2}
810000: {1,1,1,1,2,2,2,2,3,3,3,3}
9261000: {1,1,1,2,2,2,3,3,3,4,4,4}
MATHEMATICA
prisig[n_]:=If[n==1, {}, Last/@FactorInteger[n]];
q=Table[Total[prisig[n]]-Total[Union[prisig[n]]], {n, 10000}];
mnrm[s_]:=If[Min@@s==1, mnrm[DeleteCases[s-1, 0]]+1, 0];
Table[Position[q, k][[1, 1]], {k, 0, mnrm[q+1]-1}]
CROSSREFS
A005361 gives product of prime exponents.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Feb 18 2025
EXTENSIONS
a(10)-a(11) from Michel Marcus, Feb 20 2025
a(12) and beyond from David Consiglio, Jr., Feb 20 2025
STATUS
approved
