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.

A320922 Heinz numbers of graphical partitions.

Original entry on oeis.org

1, 4, 12, 16, 27, 36, 40, 48, 64, 81, 90, 108, 112, 120, 144, 160, 192, 225, 243, 252, 256, 270, 300, 324, 336, 352, 360, 400, 432, 448, 480, 567, 576, 625, 630, 640, 675, 729, 750, 756, 768, 792, 810, 832, 840, 900, 972, 1000, 1008, 1024, 1056, 1080, 1120
Offset: 1

Views

Author

Gus Wiseman, Oct 24 2018

Keywords

Comments

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
An integer partition is graphical if it comprises the vertex-degrees of some simple graph.

Examples

			The sequence of all graphical partitions begins: (), (11), (211), (1111), (222), (2211), (3111), (21111), (111111), (2222), (3221), (22211), (41111), (32111), (221111), (311111), (2111111), (3322), (22222), (42211).
		

Crossrefs

Programs

  • Mathematica
    prptns[m_]:=Union[Sort/@If[Length[m]==0,{{}},Join@@Table[Prepend[#,m[[ipr]]]&/@prptns[Delete[m,List/@ipr]],{ipr,Select[Prepend[{#},1]&/@Select[Range[2,Length[m]],m[[#]]>m[[#-1]]&],UnsameQ@@m[[#]]&]}]]];
    Select[Range[1000],Select[prptns[Flatten[MapIndexed[Table[#2,{#1}]&,If[#==1,{},Flatten[Cases[FactorInteger[#],{p_,k_}:>Table[PrimePi[p],{k}]]]]]]],UnsameQ@@#&]!={}&]