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.

Previous Showing 11-13 of 13 results.

A331684 Number of locally disjoint enriched identity p-trees of weight n.

Original entry on oeis.org

1, 1, 2, 3, 6, 14, 30, 68, 157, 379, 901, 2229, 5488, 13846, 34801, 89368, 228186, 592943, 1533511, 4026833
Offset: 1

Views

Author

Gus Wiseman, Jan 31 2020

Keywords

Comments

A locally disjoint enriched identity p-tree of weight n is either the number n itself or a finite sequence of distinct non-overlapping locally disjoint enriched identity p-trees whose weights are weakly decreasing and sum to n.

Examples

			The a(1) = 1 through a(6) = 14 enriched p-trees:
  1  2  3     4        5           6
        (21)  (31)     (32)        (42)
              ((21)1)  (41)        (51)
                       ((21)2)     (321)
                       ((31)1)     ((21)3)
                       (((21)1)1)  ((31)2)
                                   ((32)1)
                                   (3(21))
                                   ((41)1)
                                   ((21)21)
                                   (((21)1)2)
                                   (((21)2)1)
                                   (((31)1)1)
                                   ((((21)1)1)1)
		

Crossrefs

The orderless version is A316694.
The non-identity version is A331687.
Identity trees are A004111.
P-trees are A196545.
Enriched p-trees are A289501.
Locally disjoint identity trees are A316471.
Enriched identity p-trees are A331875, with locally disjoint case A331687.

Programs

  • Mathematica
    disjointQ[u_]:=Apply[And,Outer[#1==#2||Intersection[#1,#2]=={}&,u,u,1],{0,1}];
    ldeip[n_]:=Prepend[Select[Join@@Table[Tuples[ldeip/@p],{p,Rest[IntegerPartitions[n]]}],UnsameQ@@#&&disjointQ[DeleteCases[#,_Integer]]&],n];
    Table[Length[ldeip[n]],{n,12}]

A316770 Number of series-reduced locally nonintersecting rooted identity trees whose leaves form an integer partition of n.

Original entry on oeis.org

1, 1, 2, 3, 6, 13, 28, 64, 153, 379, 939, 2385, 6121, 15871, 41529, 109509, 290607, 775842, 2081874, 5612176, 15191329, 41274052
Offset: 1

Views

Author

Gus Wiseman, Jul 12 2018

Keywords

Comments

A rooted tree is series-reduced if every non-leaf node has at least two branches. It is locally nonintersecting if the intersection of all branches directly under any given root is empty. It is an identity tree if no branch appears multiple times under the same root.

Examples

			The a(6) = 13 trees:
  (1(1(1(12))))
  (1(1(13)))
  (1(2(12)))
  (2(1(12)))
  (12(12))
  (1(14))
  (1(23))
  (2(13))
  (3(12))
  (123)
  (15)
  (24)
  6
Examples of series-reduced rooted identity trees that are not locally nonintersecting are ((12)(13)) and ((12)(1(12))).
		

Crossrefs

Programs

  • Mathematica
    nonintQ[u_]:=Intersection@@u=={};
    nms[n_]:=nms[n]=Prepend[Join@@Table[Select[Union[Sort/@Tuples[nms/@ptn]],And[UnsameQ@@#,nonintQ[#]]&],{ptn,Rest[IntegerPartitions[n]]}],{n}];
    Table[Length[nms[n]],{n,15}]

Extensions

a(21)-a(22) from Robert Price, Sep 14 2018

A319291 Number of series-reduced locally disjoint rooted trees with n leaves spanning an initial interval of positive integers.

Original entry on oeis.org

1, 2, 12, 107, 1299, 20764, 412957, 9817743
Offset: 1

Views

Author

Gus Wiseman, Sep 16 2018

Keywords

Examples

			The a(3) = 12 series-reduced locally disjoint rooted trees:
  (1(11))
   (111)
  (1(22))
  (2(12))
   (122)
  (1(12))
  (2(11))
   (112)
  (1(23))
  (2(13))
  (3(12))
   (123)
The trees counted by A316651(4) but not by a(4):
  ((11)(12))
  ((12)(13))
  ((12)(22))
  ((12)(23))
  ((13)(23))
		

Crossrefs

Programs

  • Mathematica
    disjointQ[u_]:=Apply[And,Outer[#1==#2||Intersection[#1,#2]=={}&,u,u,1],{0,1}];
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];
    gro[m_]:=gro[m]=If[Length[m]==1,{m},Select[Union[Sort/@Join@@(Tuples[gro/@#]&/@Select[mps[m],Length[#]>1&])],disjointQ]];
    allnorm[n_Integer]:=Function[s,Array[Count[s,y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1];
    Table[Sum[Length[gro[m]],{m,allnorm[n]}],{n,5}]
Previous Showing 11-13 of 13 results.