OFFSET
1,2
COMMENTS
Sorted list of positive integers with a factorization Product p(i)^e(i) such that (e(1) - e(2)) >= (e(2) - e(3)) >= ... >= (e(k-1) - e(k)) >= e(k), with k = A001221(n), and p(k) = A006530(n) = A000040(k), i.e., the prime factors p(1) .. p(k) must be consecutive primes from 2 onward. - Comment clarified by Antti Karttunen, Apr 28 2022
If prime signatures are considered as partitions, these are the members of A025487 whose prime signature is conjugate to the prime signature of a member of A182863. - Matthew Vandermast, May 20 2012
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
EXAMPLE
2, 12, and 360 are all superprimorials (i.e., members of A006939). Therefore, 2*2*12*360 = 17280 is included in the sequence.
From Gus Wiseman, Aug 12 2020 (Start):
The sequence of factorizations (which are unique) begins:
1 = empty product
2 = 2
4 = 2*2
8 = 2*2*2
12 = 12
16 = 2*2*2*2
24 = 2*12
32 = 2*2*2*2*2
48 = 2*2*12
64 = 2*2*2*2*2*2
96 = 2*2*2*12
128 = 2*2*2*2*2*2*2
144 = 12*12
192 = 2*2*2*2*12
256 = 2*2*2*2*2*2*2*2
(End)
MATHEMATICA
Select[Range[100], PrimePi[First/@If[#==1, {}, FactorInteger[#]]]==Range[ PrimeNu[#]]&&LessEqual@@Differences[ Append[Last/@FactorInteger[#], 0]]&] (* Gus Wiseman, Aug 12 2020 *)
PROG
(PARI)
firstdiffs0forward(vec) = { my(v=vector(#vec)); for(n=1, #v, v[n] = vec[n]-if(#v==n, 0, vec[1+n])); (v); };
A353518(n) = if(1==n, 1, my(f=factor(n), len=#f~); if(primepi(f[len, 1])!=len, return(0), my(diffs=firstdiffs0forward(f[, 2])); for(i=1, #diffs-1, if(diffs[i+1]>diffs[i], return(0))); (1)));
isA181818(n) = A353518(n); \\ Antti Karttunen, Apr 28 2022
CROSSREFS
A181817 rearranged in numerical order. Also includes all members of A000079, A001021, A006939, A009968, A009992, A066120, A166475, A167448, A181813, A181814, A181816, A182763.
A001013 is the version for factorials.
A336426 is the complement.
A336496 is the version for superfactorials.
A001055 counts factorizations.
A006939 lists superprimorials or Chernoff numbers.
A317829 counts factorizations of superprimorials.
KEYWORD
nonn
AUTHOR
Matthew Vandermast, Nov 30 2010
STATUS
approved