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-10 of 10 results.

A326243 Number of capturing set partitions of {1..n}.

Original entry on oeis.org

0, 0, 0, 0, 1, 11, 80, 503, 2993, 17609, 105017, 644528, 4107600, 27313805, 189866541, 1379728831, 10470032837, 82833202559, 681977545967, 5832430910181, 51723181525978, 474866750479993, 4506706112772881, 44151975623559477, 445958774322599940, 4638590033810841345
Offset: 0

Views

Author

Gus Wiseman, Jun 19 2019

Keywords

Comments

A set partition is capturing if it has two blocks of the form {...x...y...}, {...z...t...} where x < z < t < y or z < x < y < t. This is a weaker condition than nesting, so for example {{1,3,5},{2,4}} is capturing but not nesting.

Examples

			The a(5) = 11 capturing set partitions:
  {{1,2,5},{3,4}}
  {{1,3,4},{2,5}}
  {{1,3,5},{2,4}}
  {{1,4},{2,3,5}}
  {{1,4,5},{2,3}}
  {{1,5},{2,3,4}}
  {{1},{2,5},{3,4}}
  {{1,4},{2,3},{5}}
  {{1,5},{2},{3,4}}
  {{1,5},{2,3},{4}}
  {{1,5},{2,4},{3}}
		

Crossrefs

Non-capturing set partitions are A054391.
Crossing and nesting set partitions are (both) A016098.

Programs

  • Mathematica
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    capXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;xt||x>z&&y
    				

Formula

a(n) = A000110(n) - A054391(n).

Extensions

a(12) and beyond from Christian Sievers, Aug 23 2024

A326255 MM-numbers of capturing multiset partitions.

Original entry on oeis.org

667, 989, 1334, 1633, 1769, 1817, 1978, 2001, 2021, 2323, 2461, 2599, 2623, 2668, 2967, 2987, 3197, 3266, 3335, 3538, 3634, 3713, 3749, 3956, 3979, 4002, 4042, 4163, 4171, 4331, 4379, 4429, 4439, 4577, 4646, 4669, 4747, 4819, 4859, 4899, 4922, 4945, 5029, 5198
Offset: 1

Views

Author

Gus Wiseman, Jun 20 2019

Keywords

Comments

First differs from A326256 in having 2599.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset multisystem with MM-number n is obtained by taking the multiset of prime indices of each prime index of n.
A multiset partition is capturing if it has two blocks of the form {...x...y...} and {...z...t...} where x < z and t < y or z < x and y < t. This is a weaker condition than nesting, so for example {{1,3,5},{2,4}} is capturing but not nesting.

Examples

			The sequence of terms together with their multiset multisystems begins:
   667: {{2,2},{1,3}}
   989: {{2,2},{1,4}}
  1334: {{},{2,2},{1,3}}
  1633: {{2,2},{1,1,3}}
  1769: {{1,3},{1,2,2}}
  1817: {{2,2},{1,5}}
  1978: {{},{2,2},{1,4}}
  2001: {{1},{2,2},{1,3}}
  2021: {{1,4},{2,3}}
  2323: {{2,2},{1,6}}
  2461: {{2,2},{1,1,4}}
  2599: {{2,2},{1,2,3}}
  2623: {{1,4},{1,2,2}}
  2668: {{},{},{2,2},{1,3}}
  2967: {{1},{2,2},{1,4}}
  2987: {{1,3},{2,2,2}}
  3197: {{2,2},{1,7}}
  3266: {{},{2,2},{1,1,3}}
  3335: {{2},{2,2},{1,3}}
  3538: {{},{1,3},{1,2,2}}
		

Crossrefs

MM-numbers of crossing multiset partitions are A324170.
MM-numbers of nesting multiset partitions are A326256.
MM-numbers of crossing capturing multiset partitions are A326259.
Capturing set partitions are A326243.

Programs

  • Mathematica
    capXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;xt||x>z&&yTable[PrimePi[p],{k}]]]];
    Select[Range[10000],capXQ[primeMS/@primeMS[#]]&]

A326248 Number of crossing, nesting set partitions of {1..n}.

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 28, 252, 1890, 13020, 86564, 571944, 3826230, 26233662, 185746860, 1364083084, 10410773076, 82609104802, 681130756224, 5829231836494, 51711093240518, 474821049202852, 4506533206814480, 44151320870760216, 445956292457725714
Offset: 0

Views

Author

Gus Wiseman, Jun 20 2019

Keywords

Comments

A set partition is crossing if it has two blocks of the form {...x,y...}, {...z,t...} where x < z < y < t or z < x < t < y, and nesting if it has two blocks of the form {...x,y...}, {...z,t...} where x < z < t < y or z < x < y < t.

Examples

			The a(5) = 2 set partitions:
  {{1,4},{2,3,5}}
  {{1,3,4},{2,5}}
		

Crossrefs

Crossing and nesting set partitions are (both) A016098.
Crossing, capturing set partitions are A326246.
Nesting, non-crossing set partitions are A122880.

Programs

  • Mathematica
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    croXQ[stn_]:=MatchQ[stn,{_,{_,x_,y_,_},_,{_,z_,t_,_},_}/;x_,{_,x_,y_,_},_,{_,z_,t_,_},_}/;x
    				

Formula

a(n) = A000110(n) - 2*A000108(n) + A001519(n). - Christian Sievers, Oct 16 2024

Extensions

a(11) and beyond from Christian Sievers, Oct 16 2024

A326237 Number of non-nesting digraphs with vertices {1..n}, where two edges (a,b), (c,d) are nesting if a < c and b > d or a > c and b < d.

Original entry on oeis.org

1, 2, 12, 104, 1008, 10272, 107712, 1150592
Offset: 0

Views

Author

Gus Wiseman, Jun 19 2019

Keywords

Comments

These are digraphs with the property that, if the edges are listed in lexicographic order, the sequence of targets is weakly increasing. For example, the digraph with lexicographically ordered edge set {(1,2),(2,1),(3,1),(3,2)} is nesting because the targets are (2,1,1,2), a sequence that is not weakly increasing.
Also the number of non-semicrossing digraphs with vertices {1..n}, where two edges (a,b), (c,d) are semicrossing if a < c and b < d or a > c and b > d. For example, the a(2) = 4 non-semicrossing digraph edge-sets are:
{}
{11}
{12}
{21}
{22}
{11,12}
{11,21}
{12,21}
{12,22}
{21,22}
{11,12,21}
{12,21,22}
Apparently a duplicate of A152254. - R. J. Mathar, Jul 12 2019

Examples

			The a(2) = 12 non-nesting digraph edge-sets:
  {}
  {11}
  {12}
  {21}
  {22}
  {11,12}
  {11,21}
  {11,22}
  {12,22}
  {21,22}
  {11,12,22}
  {11,21,22}
		

Crossrefs

Nesting digraphs are A326209.
Non-nesting set partitions are A000108.
Non-capturing set partitions are A054391.

Programs

  • Mathematica
    Table[Length[Select[Subsets[Tuples[Range[n],2]],OrderedQ[Last/@#]&]],{n,4}]

Formula

A002416(n) = a(n) + A326209(n).

A326257 MM-numbers of weakly nesting multiset partitions.

Original entry on oeis.org

49, 91, 98, 133, 147, 169, 182, 196, 203, 245, 247, 259, 266, 273, 294, 299, 301, 338, 343, 361, 364, 371, 377, 392, 399, 406, 427, 441, 455, 481, 490, 494, 497, 507, 518, 529, 532, 539, 546, 551, 553, 559, 588, 598, 602, 609, 623, 637, 665, 667, 676, 686, 689
Offset: 1

Views

Author

Gus Wiseman, Jun 21 2019

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset multisystem with MM-number n is obtained by taking the multiset of prime indices of each prime index of n.
A multiset partition is weakly nesting if it has two blocks of the form {...x,y...}, {...z,t...} where x <= z and t <= y or z <= x and y <= t.

Examples

			The sequence of terms together with their multiset multisystems begins:
   49: {{1,1},{1,1}}
   91: {{1,1},{1,2}}
   98: {{},{1,1},{1,1}}
  133: {{1,1},{1,1,1}}
  147: {{1},{1,1},{1,1}}
  169: {{1,2},{1,2}}
  182: {{},{1,1},{1,2}}
  196: {{},{},{1,1},{1,1}}
  203: {{1,1},{1,3}}
  245: {{2},{1,1},{1,1}}
  247: {{1,2},{1,1,1}}
  259: {{1,1},{1,1,2}}
  266: {{},{1,1},{1,1,1}}
  273: {{1},{1,1},{1,2}}
  294: {{},{1},{1,1},{1,1}}
  299: {{1,2},{2,2}}
  301: {{1,1},{1,4}}
  338: {{},{1,2},{1,2}}
  343: {{1,1},{1,1},{1,1}}
  361: {{1,1,1},{1,1,1}}
		

Crossrefs

MM-numbers of crossing multiset partitions are A324170.
MM-numbers of nesting multiset partitions are A324256.
MM-numbers of capturing multiset partitions are A326255.
Nesting set partitions are A016098.

Programs

  • Mathematica
    wknXQ[stn_]:=MatchQ[stn,{_,{_,x_,y_,_},_,{_,z_,t_,_},_}/;(x<=z&&y>=t)||(x>=z&&y<=t)]
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[1000],wknXQ[primeMS/@primeMS[#]]&]

A326246 Number of crossing, capturing set partitions of {1..n}.

Original entry on oeis.org

0, 0, 0, 0, 0, 3, 37, 307, 2173, 14344, 92402, 596688
Offset: 0

Views

Author

Gus Wiseman, Jun 20 2019

Keywords

Comments

A set partition is crossing if it has two blocks of the form {...x...y...}, {...z...t...} where x < z < y < t or z < x < t < y, and capturing if it has two blocks of the form {...x...y...}, {...z...t...} where x < z < t < y or z < x < y < t. Capturing is a weaker condition than nesting, so for example {{1,3,5},{2,4}} is capturing but not nesting.

Examples

			The a(5) = 3 set partitions:
  {{1,3,4},{2,5}}
  {{1,3,5},{2,4}}
  {{1,4},{2,3,5}}
		

Crossrefs

MM-numbers of crossing, capturing multiset partitions are A326259.
Crossing set partitions are A016098.
Capturing set partitions are A326243.
Crossing, nesting set partitions are A326248.
Crossing, non-capturing set partitions are A326245.
Non-crossing, capturing set partitions are A122880 (conjecture).

Programs

  • Mathematica
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    croXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;x_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;x
    				

A326249 Number of capturing set partitions of {1..n} that are not nesting.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 9, 55, 283, 1324, 5838, 24744
Offset: 0

Views

Author

Gus Wiseman, Jun 20 2019

Keywords

Comments

Capturing is a weaker condition than nesting. A set partition is capturing if it has two blocks of the form {...x...y...}, {...z...t...} where x < z < t < y or z < x < y < t, and nesting if it has two blocks of the form {...x,y...}, {...z,t...} where x < z < t < y or z < x < y < t. For example, {{1,3,5},{2,4}} is capturing but not nesting, so is counted under a(5).

Examples

			The a(6) = 9 set partitions:
  {{1},{2,4,6},{3,5}}
  {{1,3,5},{2,4},{6}}
  {{1,3,6},{2,4},{5}}
  {{1,3,6},{2,5},{4}}
  {{1,4,6},{2},{3,5}}
  {{1,4,6},{2,5},{3}}
  {{1,3,5},{2,4,6}}
  {{1,2,4,6},{3,5}}
  {{1,3,5,6},{2,4}}
		

Crossrefs

MM-numbers of capturing, non-nesting multiset partitions are A326260.
Nesting set partitions are A016098.
Capturing set partitions are A326243.
Non-crossing, nesting set partitions are A122880 (conjectured).

Programs

  • Mathematica
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    capXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;x_,{_,x_,y_,_},_,{_,z_,t_,_},_}/;x
    				

A326259 MM-numbers of crossing, capturing multiset partitions (with empty parts allowed).

Original entry on oeis.org

8903, 15167, 16717, 17806, 18647, 20329, 20453, 21797, 22489, 25607, 26709, 27649, 29551, 30334, 31373, 32741, 33434, 34691, 35177, 35612, 35821, 37091, 37133, 37294, 37969, 38243, 39493, 40658, 40906, 41449, 42011, 42949, 43594, 43817, 43873, 44515, 44861
Offset: 1

Views

Author

Gus Wiseman, Jun 22 2019

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset multisystem with MM-number n is obtained by taking the multiset of prime indices of each prime index of n.
A multiset partition is crossing if it has two blocks of the form {...x...y...}, {...z...t...} where x < z < y < t or z < x < t < y. It is capturing if it has two blocks of the form {...x...y...} and {...z...t...} where x < z and y > t or x > z and y < t. Capturing is a weaker condition than nesting, so for example {{1,3,5},{2,4}} is capturing but not nesting.

Examples

			The sequence of terms together with their multiset multisystems begins:
   8903: {{1,3},{2,2,4}}
  15167: {{1,3},{2,2,5}}
  16717: {{2,4},{1,3,3}}
  17806: {{},{1,3},{2,2,4}}
  18647: {{1,3},{2,2,6}}
  20329: {{1,3},{1,2,2,4}}
  20453: {{1,2,3},{1,2,4}}
  21797: {{1,1,3},{2,2,4}}
  22489: {{1,4},{2,2,5}}
  25607: {{1,3},{2,2,7}}
  26709: {{1},{1,3},{2,2,4}}
  27649: {{1,4},{2,2,6}}
  29551: {{1,3},{2,2,8}}
  30334: {{},{1,3},{2,2,5}}
  31373: {{2,5},{1,3,3}}
  32741: {{1,3},{2,2,2,4}}
  33434: {{},{2,4},{1,3,3}}
  34691: {{1,2,3},{2,2,4}}
  35177: {{1,3},{1,2,2,5}}
  35612: {{},{},{1,3},{2,2,4}}
		

Crossrefs

Crossing set partitions are A000108.
Capturing set partitions are A326243.
Crossing, capturing set partitions are A326246.
MM-numbers of crossing multiset partitions are A324170.
MM-numbers of nesting multiset partitions are A326256.
MM-numbers of capturing multiset partitions are A326255.
MM-numbers of unsortable multiset partitions are A326258.

Programs

  • Mathematica
    croXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;x_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;xTable[PrimePi[p],{k}]]]];
    Select[Range[100000],capXQ[primeMS/@primeMS[#]]&&croXQ[primeMS/@primeMS[#]]&]

A326335 Number of set partitions of {1..n} whose nesting blocks are connected.

Original entry on oeis.org

1, 1, 1, 1, 2, 6, 21, 86, 394, 1974, 10696
Offset: 0

Views

Author

Gus Wiseman, Jun 27 2019

Keywords

Comments

Two blocks are nesting if they are of the form {...x,y...}, {...z,t...} where x < z < t < y or z < x < y < t. A set partition has its nesting blocks connected if the graph whose vertices are the blocks and whose edges are nesting pairs of blocks is connected.

Examples

			The a(0) = 1 through a(6) = 21 set partitions:
  {}  {1}  {12}  {123}  {1234}    {12345}    {123456}
                        {14}{23}  {125}{34}  {1236}{45}
                                  {134}{25}  {1245}{36}
                                  {14}{235}  {125}{346}
                                  {145}{23}  {1256}{34}
                                  {15}{234}  {126}{345}
                                             {134}{256}
                                             {1345}{26}
                                             {1346}{25}
                                             {136}{245}
                                             {14}{2356}
                                             {145}{236}
                                             {1456}{23}
                                             {146}{235}
                                             {15}{2346}
                                             {156}{234}
                                             {16}{2345}
                                             {15}{26}{34}
                                             {16}{23}{45}
                                             {16}{24}{35}
                                             {16}{25}{34}
		

Crossrefs

Simple graphs whose nesting blocks are connected are A326330.
Set partitions whose crossing blocks are connected are A099947.
Set partitions whose capturing blocks are connected are A326336.

Programs

  • Mathematica
    nesXQ[stn_]:=MatchQ[stn,{_,{_,x_,y_,_},_,{_,z_,t_,_},_}/;x0]&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
    nestcmpts[stn_]:=csm[Union[List/@stn,Select[Subsets[stn,{2}],nesXQ]]];
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    Table[Length[Select[sps[Range[n]],Length[nestcmpts[#]]<=1&]],{n,0,5}]

A326336 Number of set partitions of {1..n} whose capturing blocks are connected.

Original entry on oeis.org

1, 1, 1, 1, 2, 7, 24, 100, 458, 2279, 12270
Offset: 0

Views

Author

Gus Wiseman, Jun 28 2019

Keywords

Comments

Two blocks are capturing if they are of the form {...x...y...}, {...z...t...} where x < z < t < y or z < x < y < t. A set partition has its capturing blocks connected if the graph whose vertices are the blocks and whose edges are capturing pairs of blocks is connected.

Examples

			The a(0) = 1 through a(6) = 24 set partitions:
  {}  {1}  {12}  {123}  {1234}    {12345}    {123456}
                        {14}{23}  {125}{34}  {1236}{45}
                                  {134}{25}  {1245}{36}
                                  {135}{24}  {1246}{35}
                                  {14}{235}  {125}{346}
                                  {145}{23}  {1256}{34}
                                  {15}{234}  {126}{345}
                                             {134}{256}
                                             {1345}{26}
                                             {1346}{25}
                                             {135}{246}
                                             {1356}{24}
                                             {136}{245}
                                             {14}{2356}
                                             {145}{236}
                                             {1456}{23}
                                             {146}{235}
                                             {15}{2346}
                                             {156}{234}
                                             {16}{2345}
                                             {15}{26}{34}
                                             {16}{23}{45}
                                             {16}{24}{35}
                                             {16}{25}{34}
		

Crossrefs

Simple graphs whose capturing blocks are connected are A326330.
Set partitions whose crossing blocks are connected are A099947.
Set partitions whose nesting blocks are connected are A326335.

Programs

  • Mathematica
    capXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;x0]&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
    captcmpts[stn_]:=csm[Union[List/@stn,Select[Subsets[stn,{2}],capXQ]]];
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    Table[Length[Select[sps[Range[n]],Length[captcmpts[#]]<=1&]],{n,0,6}]
Showing 1-10 of 10 results.