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.

A326292 Number of crossing integer partitions of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 43, 57, 80, 105, 142, 186, 248, 320, 421, 539, 698, 889, 1140, 1438, 1827, 2291, 2882, 3593, 4489, 5559, 6902, 8503, 10484, 12853, 15763
Offset: 0

Views

Author

Gus Wiseman, Oct 03 2019

Keywords

Comments

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. An integer partition is crossing if, by replacing each part with its multiset of prime indices, we obtain a crossing multiset partition.

Examples

			The a(31) = 1 through a(36) = 7 partitions:
  21,10  21,10,1  21,10,2    21,10,3      21,10,4        21,10,5
                  21,10,1,1  21,10,2,1    21,10,2,2      21,10,3,2
                             21,10,1,1,1  21,10,3,1      21,10,4,1
                                          21,10,2,1,1    21,10,2,2,1
                                          21,10,1,1,1,1  21,10,3,1,1
                                                         21,10,2,1,1,1
                                                         21,10,1,1,1,1,1
		

Crossrefs

The Heinz numbers of these partitions are given by A324170.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    croXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;x
    				

Extensions

More terms from Jinyuan Wang, Jun 28 2020