cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-6 of 6 results.

A306319 Number of length-rectangular twice-partitions of n.

Original entry on oeis.org

1, 1, 3, 5, 10, 14, 26, 35, 60, 82, 131, 177, 286, 376, 582, 793, 1202, 1610, 2450, 3274, 4906, 6665, 9770, 13274, 19690, 26506, 38596, 53006, 76432, 104189, 150844, 205282, 294304, 404146, 573140, 786169, 1119457, 1527554, 2155953, 2965567, 4163955, 5701816
Offset: 0

Views

Author

Gus Wiseman, Feb 07 2019

Keywords

Comments

A twice partition of n is a sequence of integer partitions, one of each part in an integer partition of n. It is length-rectangular if all parts have the same number of parts.

Examples

			The a(5) = 14 length-rectangular twice-partitions:
  [5] [4 1] [3 2] [3 1 1] [2 2 1] [2 1 1 1] [1 1 1 1 1]
.
  [4] [3] [2 1]
  [1] [2] [1 1]
.
  [3] [2]
  [1] [2]
  [1] [1]
.
  [2]
  [1]
  [1]
  [1]
.
  [1]
  [1]
  [1]
  [1]
  [1]

Crossrefs

Dominates A319066 (rectangular partitions of partitions), which dominates A323429 (rectangular plane partitions).
Cf. A000219, A001970, A063834 (twice-partitions), A089299, A271619, A279787 (sum-rectangular twice-partitions), A305551, A306017, A306318 (square case), A323531.

Programs

  • Mathematica
    Table[Length[Join@@Table[Select[Tuples[IntegerPartitions/@ptn],SameQ@@Length/@#&],{ptn,IntegerPartitions[n]}]],{n,20}]

A323525 Number of ways to arrange the parts of a multiset whose multiplicities are the prime indices of n into a square matrix.

Original entry on oeis.org

1, 1, 0, 0, 0, 0, 1, 0, 6, 4, 0, 12, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 36, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 84, 0, 0, 72, 0, 0, 0, 0, 0, 0, 0, 0, 126, 252, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Gus Wiseman, Jan 17 2019

Keywords

Comments

This multiset (row n of A305936) is generally not the same as the multiset of prime indices of n. For example, the prime indices of 12 are {1,1,2}, while a multiset whose multiplicities are {1,1,2} is {1,1,2,3}.

Examples

			The a(9) = 6 matrices:
  [1 1] [1 2] [1 2] [2 1] [2 1] [2 2]
  [2 2] [1 2] [2 1] [1 2] [2 1] [1 1]
The a(38) = 9 matrices:
  [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 2] [1 2 1] [2 1 1]
  [1 1 1] [1 1 1] [1 1 1] [1 1 2] [1 2 1] [2 1 1] [1 1 1] [1 1 1] [1 1 1]
  [1 1 2] [1 2 1] [2 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1]

Crossrefs

The positions of 0's are numbers whose sum of prime indices is not a perfect square (A323527).
The positions of 1's are primes indexed by squares (A323526).
Cf. A008480, A026478, A056239, A103198, A112798, A120732, A318284, A318762, A323519, A323528, A323531.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,Reverse[primeMS[n]]];
Table[If[IntegerQ[Sqrt[Total[primeMS[n]]]],Length[Permutations[nrmptn[n]]],0],{n,100}]

Formula

If A056239(n) is a perfect square, a(n) = A318762(n). Otherwise, a(n) = 0.

A323519 a(n) is the number of ways to fill a square matrix with the multiset of prime factors of n, if the number of prime factors (counted with multiplicity) is a perfect square, and a(n) = 0 otherwise.

Original entry on oeis.org

1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 4, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 6, 1, 0, 0, 4, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 4, 0, 4, 0, 0, 1, 12, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 12, 0, 0
Offset: 1

Views

Author

Gus Wiseman, Jan 17 2019

Keywords

Examples

			The a(60) = 12 matrices:
  [2 2] [2 2] [2 3] [2 3] [2 5] [2 5] [3 2] [3 2] [3 5] [5 2] [5 2] [5 3]
  [3 5] [5 3] [2 5] [5 2] [2 3] [3 2] [2 5] [5 2] [2 2] [2 3] [3 2] [2 2]

Crossrefs

Positions of 0's are A323521.
Positions of 1's are A323520.
Cf. A000290, A008480, A026478, A056239, A089299, A103198, A112798, A120732, A323433, A323525, A323531.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[If[IntegerQ[Sqrt[PrimeOmega[n]]],Length[Permutations[primeMS[n]]],0],{n,100}]

Formula

If A001222(n) is a perfect square, then a(n) = A008480(n). Otherwise, a(n) = 0.

A306318 Number of square twice-partitions of n.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 4, 5, 10, 12, 19, 24, 39, 49, 73, 104, 151, 212, 317, 443, 638, 936, 1296, 1841, 2635, 3641, 5069, 7176, 9884, 13614, 19113, 26162, 36603, 50405, 70153, 96176, 135388, 184753, 257882, 353587, 494653, 671992, 934905, 1272195, 1762979, 2389255
Offset: 0

Views

Author

Gus Wiseman, Feb 07 2019

Keywords

Comments

A twice partition of n is a sequence of integer partitions, one of each part in an integer partition of n. It is square if the number of parts is equal to the number of parts in each part.

Examples

			The a(10) = 19 square twice-partitions:
  ((ten))  ((32)(32))  ((211)(111)(111))
           ((32)(41))
           ((33)(22))
           ((33)(31))
           ((41)(32))
           ((41)(41))
           ((42)(22))
           ((42)(31))
           ((43)(21))
           ((44)(11))
           ((51)(22))
           ((51)(31))
           ((52)(21))
           ((53)(11))
           ((61)(21))
           ((62)(11))
           ((71)(11))

Links

Crossrefs

Cf. A000219, A001970, A063834 (twice-partitions), A089299 (square plane partitions), A279787, A305551, A306017, A306319 (rectangular twice-partitions), A319066, A323429, A323531 (square partitions of partitions).

Programs

  • Mathematica
    Table[Sum[Length[Union@@(Tuples[IntegerPartitions[#,{k}]&/@#]&/@IntegerPartitions[n,{k}])],{k,0,Sqrt[n]}],{n,0,20}]

A323530 Number of square plane partitions of n with strictly decreasing rows and columns.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 4, 5, 8, 10, 15, 18, 25, 30, 39, 46, 58, 67, 82, 94, 112, 127, 149, 168, 194, 218, 251, 282, 324, 368, 425, 489, 573, 670, 797, 952, 1148, 1392, 1703, 2086, 2568, 3168, 3908, 4823, 5947, 7318, 8986, 11012, 13443, 16371, 19866
Offset: 0

Views

Author

Gus Wiseman, Jan 17 2019

Keywords

Examples

			The a(12) = 8 plane partitions:
  [12]
.
  [5 4] [6 3] [7 2] [5 3] [6 2] [4 3] [5 2]
  [2 1] [2 1] [2 1] [3 1] [3 1] [3 2] [4 1]

Crossrefs

Cf. A000219, A089299, A306320, A323429, A323434, A323439, A323522, A323529, A323530, A323531.

Programs

  • Mathematica
    Table[Sum[Length[Select[Tuples[IntegerPartitions[#,{Length[ptn]}]&/@ptn],And@@Greater@@@#&&And@@Greater@@@Transpose[#]&]],{ptn,IntegerPartitions[n]}],{n,30}]

A306320 Number of square plane partitions of n with distinct row sums and distinct column sums.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 5, 5, 10, 11, 18, 21, 31, 37, 56, 70, 97, 134, 180, 247, 343, 462, 623, 850, 1128, 1509, 2004, 2649, 3467, 4590, 5958, 7814, 10161, 13287, 17208, 22495, 29129, 37997, 49229, 64098, 82940, 107868, 139390, 180737, 233214, 301527, 388018, 500058
Offset: 0

Views

Author

Gus Wiseman, Feb 07 2019

Keywords

Examples

			The a(12) = 21 square plane partitions with distinct row sums and distinct column sums:
[twelve]
.
[64][73][82][91][54][63][72][81][44][53][53][62][62][71][43][43][52][52][61]
[11][11][11][11][21][21][21][21][31][22][31][22][31][31][32][41][32][41][41]
.
[221]
[211]
[111]

Crossrefs

Cf. A000219, A089299 (square plane partitions), A101509, A271619, A279785, A306318, A323429, A323529, A323530, A323531.

Programs

  • Mathematica
    Table[Sum[Length[Select[Union[Reverse/@Sort/@Tuples[IntegerPartitions[#,{Length[ptn]}]&/@ptn]],UnsameQ@@Total/@#&&UnsameQ@@Total/@If[#=={},{},Transpose[#]]&&And@@OrderedQ/@Reverse/@If[#=={},{},Transpose[#]]&]],{ptn,IntegerPartitions[n]}],{n,0,20}]
Showing 1-6 of 6 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.