A336496 -id:A336496 - cp's OEIS frontend

A006939 Chernoff sequence: a(n) = Product_{k=1..n} prime(k)^(n-k+1).

1, 2, 12, 360, 75600, 174636000, 5244319080000, 2677277333530800000, 25968760179275365452000000, 5793445238736255798985527240000000, 37481813439427687898244906452608585200000000, 7517370874372838151564668004911177464757864076000000000, 55784440720968513813368002533861454979548176771615744085560000000000

Offset: 0

N. J. A. Sloane

Product of first n primorials: a(n) = Product_{i=1..n} A002110(i).
Superprimorials, from primorials by analogy with superfactorials.
Smallest number k with n distinct exponents in its prime factorization, i.e., A071625(k) = n.
Subsequence of A130091. - Reinhard Zumkeller, May 06 2007
Hankel transform of A171448. - Paul Barry, Dec 09 2009
This might be a good place to explain the name "Chernoff sequence" since his name does not appear in the References or Links as of Mar 22 2014. - Jonathan Sondow, Mar 22 2014
Pickover (1992) named this sequence after Paul Chernoff of California, who contributed this sequence to his book. He was possibly referring to American mathematician Paul Robert Chernoff (1942 - 2017), a professor at the University of California. - Amiram Eldar, Jul 27 2020

			a(4) = 360 because 2^3 * 3^2 * 5 = 1 * 2 * 6 * 30 = 360.
a(5) = 75600 because 2^4 * 3^3 * 5^2 * 7 = 1 * 2 * 6 * 30 * 210 = 75600.

Clifford A. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, p. 351.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James K. Strayer, Elementary number theory, Waveland Press, Inc., Long Grove, IL, 1994. See p. 37.

T. D. Noe, Table of n, a(n) for n=0..25

Cf. A000178 (product of first n factorials), A007489 (sum of first n factorials), A060389 (sum of first n primorials).
Cf. A002110, A051357.
A000142 counts divisors of superprimorials.
A000325 counts uniform divisors of superprimorials.
A008302 counts divisors of superprimorials by bigomega.
A022915 counts permutations of prime indices of superprimorials.
A076954 is a sister-sequence.
A118914 has row a(n) equal to {1..n}.
A124010 has row a(n) equal to {n..1}.
A130091 lists numbers with distinct prime multiplicities.
A317829 counts factorizations of superprimorials.
A336417 counts perfect-power divisors of superprimorials.
A336426 gives non-products of superprimorials.
Cf. A001221, A001222, A005117, A022559, A071625, A181796, A181819, A336419, A336420, A336496.

a006939 n = a006939_list !! n
a006939_list = scanl1 (*) a002110_list -- Reinhard Zumkeller, Jul 21 2012

[1] cat [(&*[NthPrime(k)^(n-k+1): k in [1..n]]): n in [1..15]]; // G. C. Greubel, Oct 14 2018

a := []; printlevel := -1; for k from 0 to 20 do a := [op(a),product(ithprime(i)^(k-i+1),i=1..k)] od; print(a);

Rest[FoldList[Times,1,FoldList[Times,1,Prime[Range[15]]]]] (* Harvey P. Dale, Jul 07 2011 *)
Table[Times@@Table[Prime[i]^(n - i + 1), {i, n}], {n, 12}] (* Alonso del Arte, Sep 30 2011 *)

a(n)=prod(k=1,n,prime(k)^(n-k+1)) \\ Charles R Greathouse IV, Jul 25 2011

from math import prod
from sympy import prime
def A006939(n): return prod(prime(k)**(n-k+1) for k in range(1,n+1)) # Chai Wah Wu, Aug 12 2025

a(n) = m(1)*m(2)*m(3)*...*m(n), where m(n) = n-th primorial number. - N. J. A. Sloane, Feb 20 2005
a(0) = 1, a(n) = a(n - 1)p(n)#, where p(n)# is the n-th primorial A002110(n) (the product of the first n primes). - Alonso del Arte, Sep 30 2011
log a(n) = n^2(log n + log log n - 3/2 + o(1))/2. - Charles R Greathouse IV, Mar 14 2011
A181796(a(n)) = A000110(n+1). It would be interesting to have a bijective proof of this theorem, which is stated at A181796 without proof. See also A336420. - Gus Wiseman, Aug 03 2020

Corrected and extended by Labos Elemer, May 30 2001

A181818 Products of superprimorials (A006939).

Original entry on oeis.org

1, 2, 4, 8, 12, 16, 24, 32, 48, 64, 96, 128, 144, 192, 256, 288, 360, 384, 512, 576, 720, 768, 1024, 1152, 1440, 1536, 1728, 2048, 2304, 2880, 3072, 3456, 4096, 4320, 4608, 5760, 6144, 6912, 8192, 8640, 9216, 11520, 12288, 13824, 16384, 17280, 18432, 20736, 23040, 24576, 27648, 32768

Offset: 1

Matthew Vandermast, Nov 30 2010

nonn

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
Subsequence of A025487. A025487(n) belongs to this sequence iff A181815(n) is a member of A025487.
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

			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)

Amiram Eldar, Table of n, a(n) for n = 1..10000

A181817 rearranged in numerical order. Also includes all members of A000079, A001021, A006939, A009968, A009992, A066120, A166475, A167448, A181813, A181814, A181816, A182763.
Subsequence of A025487, A055932, A087980, A130091, A181824.
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.
Cf. A022915, A076954, A304686, A325368, A336419, A336420, A336421, A353518 (characteristic function).

Select[Range[100],PrimePi[First/@If[#==1,{}, FactorInteger[#]]]==Range[ PrimeNu[#]]&&LessEqual@@Differences[ Append[Last/@FactorInteger[#],0]]&] (* Gus Wiseman, Aug 12 2020 *)

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

A317829 Number of set partitions of multiset {1, 2, 2, 3, 3, 3, ..., n X n}.

Original entry on oeis.org

1, 1, 4, 52, 2776, 695541, 927908528, 7303437156115, 371421772559819369, 132348505150329265211927, 355539706668772869353964510735, 7698296698535929906799439134946965681, 1428662247641961794158621629098030994429958386, 2405509035205023556420199819453960482395657232596725626

Offset: 0

Antti Karttunen, Aug 10 2018

nonn

Number of factorizations of the superprimorial A006939(n) into factors > 1. - Gus Wiseman, Aug 21 2020

			For n = 2 we have a multiset {1, 2, 2} which can be partitioned as {{1}, {2}, {2}} or {{1, 2}, {2}} or {{1}, {2, 2}} or {{1, 2, 2}}, thus a(2) = 4.

Index entries for sequences related to partitions

Cf. A033312, A317826.
Subsequence of A317828.
A000142 counts submultisets of the same multiset.
A022915 counts permutations of the same multiset.
A337069 is the strict case.
A001055 counts factorizations.
A006939 lists superprimorials or Chernoff numbers.
A076716 counts factorizations of factorials.
A076954 can be used instead of A006939 (cf. A307895, A325337).
A181818 lists products of superprimorials, with complement A336426.
Cf. A000178, A002110, A022559, A027423, A124010, A303279, A318284, A322583, A336417, A336496.

g:= proc(n, k) option remember; uses numtheory; `if`(n>k, 0, 1)+
     `if`(isprime(n), 0, add(`if`(d>k or max(factorset(n/d))>d, 0,
        g(n/d, d)), d=divisors(n) minus {1, n}))
    end:
a:= n-> g(mul(ithprime(i)^i, i=1..n)$2):
seq(a(n), n=0..5);  # Alois P. Heinz, Jul 26 2020

chern[n_]:=Product[Prime[i]^(n-i+1),{i,n}];
facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[facs[chern[n]]],{n,3}] (* Gus Wiseman, Aug 21 2020 *)

\\ See A318284 for count.
a(n) = {if(n==0, 1, count(vector(n,i,i)))} \\ Andrew Howroyd, Aug 31 2020

a(n) = A317826(A033312(n+1)) = A317826((n+1)!-1) = A001055(A076954(n)).
a(n) = A001055(A006939(n)). - Gus Wiseman, Aug 21 2020
a(n) = A318284(A002110(n)). - Andrew Howroyd, Aug 31 2020

a(0)=1 prepended and a(7) added by Alois P. Heinz, Jul 26 2020

a(8)-a(13) from Andrew Howroyd, Aug 31 2020

A336426 Numbers that cannot be written as a product of superprimorials {2, 12, 360, 75600, ...}.

Original entry on oeis.org

3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76

Offset: 1

Gus Wiseman, Jul 26 2020

nonn

The n-th superprimorial is A006939(n) = Product_{i = 1..n} prime(i)^(n - i + 1).

			We have 288 = 2*12*12 so 288 is not in the sequence.

A181818 is the complement.
A336497 is the version for superfactorials.
A001055 counts factorizations.
A006939 lists superprimorials or Chernoff numbers.
A022915 counts permutations of prime indices of superprimorials.
A317829 counts factorizations of superprimorials.
A336417 counts perfect-power divisors of superprimorials.
Cf. A000325, A005117, A076954, A124010, A294068, A336419, A336420, A336421, A336496, A336500, A336568.

chern[n_]:=Product[Prime[i]^(n-i+1),{i,n}];
facsusing[s_,n_]:=If[n<=1,{{}},Join@@Table[(Prepend[#,d]&)/@Select[facsusing[Select[s,Divisible[n/d,#]&],n/d],Min@@#>=d&],{d,Select[s,Divisible[n,#]&]}]];
Select[Range[100],facsusing[Array[chern,30],#]=={}&]

A336497 Numbers that cannot be written as a product of superfactorials A000178.

Original entry on oeis.org

3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76

Offset: 1

Gus Wiseman, Aug 03 2020

nonn

First differs from A336426 in having 360.

			The sequence of terms together with their prime indices begins:
     3: {2}        22: {1,5}        39: {2,6}
     5: {3}        23: {9}          40: {1,1,1,3}
     6: {1,2}      25: {3,3}        41: {13}
     7: {4}        26: {1,6}        42: {1,2,4}
     9: {2,2}      27: {2,2,2}      43: {14}
    10: {1,3}      28: {1,1,4}      44: {1,1,5}
    11: {5}        29: {10}         45: {2,2,3}
    13: {6}        30: {1,2,3}      46: {1,9}
    14: {1,4}      31: {11}         47: {15}
    15: {2,3}      33: {2,5}        49: {4,4}
    17: {7}        34: {1,7}        50: {1,3,3}
    18: {1,2,2}    35: {3,4}        51: {2,7}
    19: {8}        36: {1,1,2,2}    52: {1,1,6}
    20: {1,1,3}    37: {12}         53: {16}
    21: {2,4}      38: {1,8}        54: {1,2,2,2}

A093373 is the version for factorials, with complement A001013.
A336426 is the version for superprimorials, with complement A181818.
A336496 is the complement.
A000178 lists superfactorials.
A001055 counts factorizations.
A006939 lists superprimorials or Chernoff numbers.
A049711 is the minimum prime multiplicity in A000178(n).
A174605 is the maximum prime multiplicity in A000178(n).
A303279 counts prime factors (with multiplicity) of superprimorials.
A317829 counts factorizations of superprimorials.
A322583 counts factorizations into factorials.
A325509 counts factorizations of factorials into factorials.
Cf. A000142, A000720, A007489, A011371, A022559, A022915, A027423, A034878, A034876, A076954, A115627, A294068.

supfac[n_]:=Product[k!,{k,n}];
facsusing[s_,n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facsusing[Select[s,Divisible[n/d,#]&],n/d],Min@@#>=d&]],{d,Select[s,Divisible[n,#]&]}]];
Select[Range[100],facsusing[Rest[Array[supfac,30]],#]=={}&]

A336620 Numbers that are not a product of elements of A304711.

Original entry on oeis.org

3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 25, 27, 29, 31, 37, 39, 41, 42, 43, 47, 49, 53, 57, 59, 61, 63, 65, 67, 71, 73, 78, 79, 81, 83, 87, 89, 91, 97, 101, 103, 105, 107, 109, 111, 113, 114, 115, 117, 121, 125, 126, 127, 129, 130, 131, 133, 137, 139, 147, 149

Offset: 1

Gus Wiseman, Aug 02 2020

nonn

A304711 lists numbers whose distinct prime indices are pairwise coprime.

The first term divisible by 4 is a(421) = 1092.

			The sequence of terms together with their prime indices begins:
      3: {2}         39: {2,6}       78: {1,2,6}
      5: {3}         41: {13}        79: {22}
      7: {4}         42: {1,2,4}     81: {2,2,2,2}
      9: {2,2}       43: {14}        83: {23}
     11: {5}         47: {15}        87: {2,10}
     13: {6}         49: {4,4}       89: {24}
     17: {7}         53: {16}        91: {4,6}
     19: {8}         57: {2,8}       97: {25}
     21: {2,4}       59: {17}       101: {26}
     23: {9}         61: {18}       103: {27}
     25: {3,3}       63: {2,2,4}    105: {2,3,4}
     27: {2,2,2}     65: {3,6}      107: {28}
     29: {10}        67: {19}       109: {29}
     31: {11}        71: {20}       111: {2,12}
     37: {12}        73: {21}       113: {30}

Gus Wiseman, Sequences counting and encoding certain classes of multisets

A336426 is the version for superprimorials, with complement A181818.
A336497 is the version for superfactorials, with complement A336496.
A336735 is the complement.
A000837 counts relatively prime partitions, with strict case A007360.
A001055 counts factorizations.
A302696 lists numbers with coprime prime indices.
A304711 lists numbers with coprime distinct prime indices.
Cf. A007916, A112798, A302569, A327516, A333228, A335238, A335239, A335240, A335241, A336424, A336568, A336736.

nn=100;
dat=Select[Range[nn],CoprimeQ@@PrimePi/@First/@FactorInteger[#]&];
facsusing[s_,n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facsusing[Select[s,Divisible[n/d,#]&],n/d],Min@@#>=d&]],{d,Select[s,Divisible[n,#]&]}]];
Select[Range[nn],facsusing[dat,#]=={}&]

A336735 Products of elements of A304711.

Original entry on oeis.org

1, 2, 4, 6, 8, 10, 12, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32, 33, 34, 35, 36, 38, 40, 44, 45, 46, 48, 50, 51, 52, 54, 55, 56, 58, 60, 62, 64, 66, 68, 69, 70, 72, 74, 75, 76, 77, 80, 82, 84, 85, 86, 88, 90, 92, 93, 94, 95, 96, 98, 99, 100, 102, 104, 106

Offset: 1

Gus Wiseman, Aug 02 2020

nonn

A304711 lists numbers whose distinct prime indices are pairwise coprime.

First differs from A304711 in having 84.

			The sequence of terms together with their prime indices begins:
      1: {}            28: {1,1,4}         52: {1,1,6}
      2: {1}           30: {1,2,3}         54: {1,2,2,2}
      4: {1,1}         32: {1,1,1,1,1}     55: {3,5}
      6: {1,2}         33: {2,5}           56: {1,1,1,4}
      8: {1,1,1}       34: {1,7}           58: {1,10}
     10: {1,3}         35: {3,4}           60: {1,1,2,3}
     12: {1,1,2}       36: {1,1,2,2}       62: {1,11}
     14: {1,4}         38: {1,8}           64: {1,1,1,1,1,1}
     15: {2,3}         40: {1,1,1,3}       66: {1,2,5}
     16: {1,1,1,1}     44: {1,1,5}         68: {1,1,7}
     18: {1,2,2}       45: {2,2,3}         69: {2,9}
     20: {1,1,3}       46: {1,9}           70: {1,3,4}
     22: {1,5}         48: {1,1,1,1,2}     72: {1,1,1,2,2}
     24: {1,1,1,2}     50: {1,3,3}         74: {1,12}
     26: {1,6}         51: {2,7}           75: {2,3,3}

Gus Wiseman, Sequences counting and encoding certain classes of multisets

A181818 is the version for superprimorials, with complement A336426.
A336496 is the version for superfactorials, with complement A336497.
A336620 is the complement.
A000837 counts relatively prime partitions, with strict case A007360.
A001055 counts factorizations.
A302696 lists numbers with coprime prime indices.
A304711 lists numbers with coprime distinct prime indices.
Cf. A001221, A007360, A007916, A056239, A112798, A302569, A327516, A333228, A335238, A335239, A335240, A336424, A336497, A336736.

nn=100;
dat=Select[Range[nn],CoprimeQ@@PrimePi/@First/@FactorInteger[#]&];
facsusing[s_,n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facsusing[Select[s,Divisible[n/d,#]&],n/d],Min@@#>=d&]],{d,Select[s,Divisible[n,#]&]}]];
Select[Range[nn],facsusing[dat,#]!={}&]

A356639 Number of integer sequences b with b(1) = 1, b(m) > 0 and b(m+1) - b(m) > 0, of length n which transform under the map S into a nonnegative integer sequence. The transform c = S(b) is defined by c(m) = Product_{k=1..m} b(k) / Product_{k=2..m} (b(k) - b(k-1)).

Original entry on oeis.org

1, 1, 3, 17, 155, 2677, 73327, 3578339, 329652351

Offset: 1

Thomas Scheuerle, Aug 19 2022

This sequence can be calculated by a recursive algorithm:
Let B1 be an array of finite length, the "1" denotes that it is the first generation. Let B1' be the reversed version of B1. Let C be the element-wise product C = B1 * B1'. Then B2 is a concatenation of taking each element of B1 and add all divisors of the corresponding element in C. If we start with B1 = {1} then we get this sequence of arrays: B2 = {2}, B3 = {3, 4, 6}, ... . a(n) is the length of the array Bn. In short the length of Bn+1 and so a(n+1) is the sum over A000005(Bn * Bn').
The transform used in the definition of this sequence is its own inverse, so if c = S(b) then b = S(c). The eigensequence is 2^n = S(2^n).
There exist some transformation pairs of infinite sequences in the database:
  A000027 <--> A000142; A000079 <--> A000079; A000045 <--> A001654;
  A026549 <--> A038754; A100071 <--> A001405; A058295 <--> A------;
  A111286 <--> A098011; A093968 <--> A205825; A166447 <--> A------;
  A098558 <--> A004277; A010551 <--> A087811; A100538 <--> A329227;
  A079352 <--> A------; A082458 <--> A------; A008233 <--> A264635;
  A138278 <--> A------; A006501 <--> A264557; A336496 <--> A------;
  A019464 <--> A------; A062112 <--> A------; A171647 <--> A359039;
  A279312 <--> A------; A031923 <--> A------.
These transformation pairs are conjectured:
  A137326 <--> A------; A066332 <--> A300902; A208147 <--> A308546;
  A057895 <--> A------; A349080 <--> A------; A019442 <--> A------;
  A349079 <--> A------.
("A------" means not yet in the database.)
Some sequences in the lists above may need offset adjustment to force a beginning with 1,2,... in the transformation.
If we allowed signed rational numbers, further interesting transformation pairs could be observed. For example, 1/n will transform into factorials with alternating sign. 2^(-n) transforms into ones with alternating sign and 1/A000045(n) into A000045 with alternating sign.

			a(4) = 17. The 17 transformation pairs of length 4 are:
  {1, 2, 3, 4}  = S({1, 2, 6, 24}).
  {1, 2, 3, 5}  = S({1, 2, 6, 15}).
  {1, 2, 3, 6}  = S({1, 2, 6, 12}).
  {1, 2, 3, 9}  = S({1, 2, 6, 9}).
  {1, 2, 3, 12} = S({1, 2, 6, 8}).
  {1, 2, 3, 21} = S({1, 2, 6, 7}).
  {1, 2, 4, 5}  = S({1, 2, 4, 20}).
  {1, 2, 4, 6}  = S({1, 2, 4, 12}).
  {1, 2, 4, 8}  = S({1, 2, 4, 8}).
  {1, 2, 4, 12} = S({1, 2, 4, 6}).
  {1, 2, 4, 20} = S({1, 2, 4, 5}).
  {1, 2, 6, 7}  = S({1, 2, 3, 21}).
  {1, 2, 6, 8}  = S({1, 2, 3, 12}).
  {1, 2, 6, 9}  = S({1, 2, 3, 9}).
  {1, 2, 6, 12} = S({1, 2, 3, 6}).
  {1, 2, 6, 15} = S({1, 2, 3, 5}).
  {1, 2, 6, 24} = S({1, 2, 3, 4}).
b(1) = 1 by definition, b(2) = 1+1 as 1 has only 1 as divisor.
a(3) = A000005(b(2)*b(2)) = 3.
The divisors of b(2) are 1,2,4. So b(3) can be b(2)+1, b(2)+2 and b(2)+4.
a(4) = A000005((b(2)+1)*(b(2)+4)) + A000005((b(2)+2)*(b(2)+2)) + A000005((b(2)+4)*(b(2)+1)) = 17.

Cf. A000005.
Cf. A000027, A000045, A000079, A000142, A001405.
Cf. A001654, A004277, A006501, A008233, A019442.
Cf. A010551, A019464, A026549, A031923, A038754.
Cf. A057895, A058295, A062112, A066332, A100071.
Cf. A079352, A082458, A087811, A093968, A098011.
Cf. A098558, A100538, A111286, A166447, A137326.
Cf. A138278, A171647, A205825, A208147, A264557.
Cf. A264635, A308546, A329227, A336496, A349079.
Cf. A349080, A359039.

cp's OEIS Frontend

A006939 Chernoff sequence: a(n) = Product_{k=1..n} prime(k)^(n-k+1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

Extensions

A181818 Products of superprimorials (A006939).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A317829 Number of set partitions of multiset {1, 2, 2, 3, 3, 3, ..., n X n}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A336426 Numbers that cannot be written as a product of superprimorials {2, 12, 360, 75600, ...}.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A336497 Numbers that cannot be written as a product of superfactorials A000178.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A336620 Numbers that are not a product of elements of A304711.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A336735 Products of elements of A304711.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs