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.

A324324 MM-numbers of crossing set partitions.

Original entry on oeis.org

2117, 3973, 4843, 5891, 6757, 7181, 7801, 10019, 10063, 11051, 11567, 13021, 13193, 13459, 14123, 14921, 17603, 18407, 18761, 18877, 19307, 19633, 20941, 21083, 21251, 21457, 22849, 23519, 23533, 24727, 26101, 27133, 27169, 27173, 27413, 29111, 30479, 31261
Offset: 1

Views

Author

Gus Wiseman, Feb 22 2019

Keywords

Comments

A multiset multisystem is a finite multiset of finite multisets. 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 formed by taking the multiset of prime indices of each part in the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset multisystem with MM-number 78 is {{},{1},{1,2}}.
A multiset multisystem is crossing if it contains two parts of the form {{...x...y...},{...z...t...}} with x < z < y < t or z < x < t < y.

Crossrefs

Cf. A000108 (non-crossing set partitions), A001055, A001222, A003963, A005117, A016098 (crossing set partitions), A054726, A056239, A112798, A302242, A302243, A302505, A302521 (MM-numbers of set partitions).

Programs

  • Mathematica
    croXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;xTable[PrimePi[p],{k}]]]];
    setptnQ[bks_]:=UnsameQ@@Join@@bks&&!MemberQ[bks,{}];
    Select[Range[10000],And[croXQ[primeMS/@primeMS[#]],setptnQ[primeMS/@primeMS[#]]]&]