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.

A306558 Number of double-crossing set partitions of {1,...,n}.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 14, 141, 1267, 10841, 91091, 764092
Offset: 0

Views

Author

Gus Wiseman, Feb 23 2019

Keywords

Comments

Two blocks of a set partitions double-cross each other if they are of the form {{...a...b...c...},{...x...y...z...}} for some a < x < b < y < c < z or x < a < y < b < z < c.

Examples

			The a(7) = 14 double-crossing set partitions:
  {{1,3,5},{2,4,6,7}}
  {{1,3,6},{2,4,5,7}}
  {{1,4,6},{2,3,5,7}}
  {{1,2,4,6},{3,5,7}}
  {{1,3,4,6},{2,5,7}}
  {{1,3,5,6},{2,4,7}}
  {{1,3,5,7},{2,4,6}}
  {{1},{2,4,6},{3,5,7}}
  {{1,3,5},{2,4,6},{7}}
  {{1,3,5},{2,4,7},{6}}
  {{1,3,6},{2,4,7},{5}}
  {{1,3,6},{2,5,7},{4}}
  {{1,4,6},{2},{3,5,7}}
  {{1,4,6},{2,5,7},{3}}
		

Crossrefs

Programs

  • Mathematica
    croXXQ[stn_]:=MatchQ[stn,{_,{_,a_,_,b_,_,c_,_},_,{_,x_,_,y_,_,z_,_},_}/;a_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    Table[Length[Select[sps[Range[n]],croXXQ]],{n,0,8}]