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 21-27 of 27 results.

A318187 Number of totally transitive rooted trees with n leaves.

Original entry on oeis.org

2, 2, 4, 8, 16, 32, 62, 122, 234, 451, 857, 1630, 3068, 5772, 10778, 20093, 37259
Offset: 1

Views

Author

Gus Wiseman, Aug 20 2018

Keywords

Comments

A rooted tree is totally transitive if every branch of the root is totally transitive and every branch of a branch of the root is also a branch of the root.

Examples

			The a(5) = 16 totally transitive rooted trees with 5 leaves:
  (o(o)(o(o)(o)))
  (o(o)(o)(o(o)))
  (o(o)(o)(o)(o))
  (o(o)(oo(o)))
  (oo(o)(o(o)))
  (o(o)(o)(oo))
  (oo(o)(o)(o))
  (o(o)(ooo))
  (o(oo)(oo))
  (oo(o)(oo))
  (ooo(o)(o))
  (o(oooo))
  (oo(ooo))
  (ooo(oo))
  (oooo(o))
  (ooooo)

Crossrefs

Cf. A000081, A000669, A001678, A004111, A050381, A279861, A290689, A290760, A290822, A318185, A318186.

Programs

  • Mathematica
    totralv[n_]:=totralv[n]=If[n==1,{{},{{}}},Join@@Table[Select[Union[Sort/@Tuples[totralv/@c]],Complement[Union@@#,#]=={}&],{c,Select[IntegerPartitions[n],Length[#]>1&]}]];
Table[Length[totralv[n]],{n,8}]

A324839 Number of unlabeled rooted identity trees with n nodes where the branches of no branch of the root form a subset of the branches of the root.

Original entry on oeis.org

1, 0, 1, 1, 2, 3, 8, 16, 35, 74, 166, 367, 831, 1878, 4299, 9857, 22775, 52777, 122957, 287337
Offset: 1

Views

Author

Gus Wiseman, Mar 18 2019

Keywords

Comments

An unlabeled rooted tree is an identity tree if there are no repeated branches directly under the same root.
Also the number of finitary sets with n brackets where no element is also a subset. For example, the a(7) = 8 sets are (o = {}):
{{{{{{o}}}}}}
{{{{o,{o}}}}}
{{{o,{{o}}}}}
{{o,{{{o}}}}}
{{o,{o,{o}}}}
{{{o},{{o}}}}
{{o},{{{o}}}}
{{o},{o,{o}}}

Examples

			The a(1) = 1 through a(8) = 16 rooted identity trees:
  o  ((o))  (((o)))  ((o(o)))   (((o(o))))   ((o)(o(o)))    (((o))(o(o)))
                     ((((o))))  ((o((o))))   ((o(o(o))))    (((o)(o(o))))
                                (((((o)))))  ((((o(o)))))   (((o(o(o)))))
                                             (((o)((o))))   ((o)((o(o))))
                                             (((o((o)))))   ((o)(o((o))))
                                             ((o)(((o))))   ((o((o(o)))))
                                             ((o(((o)))))   ((o(o)((o))))
                                             ((((((o))))))  ((o(o((o)))))
                                                            (((((o(o))))))
                                                            ((((o)((o)))))
                                                            ((((o((o))))))
                                                            (((o)(((o)))))
                                                            (((o(((o))))))
                                                            ((o)((((o)))))
                                                            ((o((((o))))))
                                                            (((((((o)))))))

Crossrefs

Cf. A000081, A290760, A304360, A306844, A317787.
Cf. A324694, A324696, A324704, A324738, A324744, A324758, A324759, A324767, A324770, A324771, A324838, A324840, A324844, A324846.

Programs

  • Mathematica
    idall[n_]:=If[n==1,{{}},Select[Union[Sort/@Join@@(Tuples[idall/@#]&/@IntegerPartitions[n-1])],UnsameQ@@#&]];
Table[Length[Select[idall[n],And@@Table[!SubsetQ[#,b],{b,#}]&]],{n,10}]

A298538 Matula-Goebel numbers of rooted trees such that every branch of the root has the same number of nodes.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 35, 37, 41, 43, 47, 49, 53, 59, 61, 64, 67, 71, 73, 79, 81, 83, 89, 97, 101, 103, 107, 109, 113, 121, 125, 127, 128, 131, 137, 139, 143, 149, 151, 157, 163, 167, 169, 173, 175, 179, 181, 187
Offset: 1

Views

Author

Gus Wiseman, Jan 21 2018

Keywords

Examples

			Sequence of trees begins:
1  o
2  (o)
3  ((o))
4  (oo)
5  (((o)))
7  ((oo))
8  (ooo)
9  ((o)(o))
11 ((((o))))
13 ((o(o)))
16 (oooo)
17 (((oo)))
19 ((ooo))
23 (((o)(o)))
25 (((o))((o)))
27 ((o)(o)(o))
29 ((o((o))))
31 (((((o)))))

Crossrefs

Cf. A000081, A007097, A061775, A111299, A214577, A276625, A290760, A291442, A297571, A298478, A298534, A298536, A298537.

Programs

  • Mathematica
    nn=500;
primeMS[n_]:=If[n===1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
MGweight[n_]:=If[n===1,1,1+Total[MGweight/@primeMS[n]]];
Select[Range[nn],SameQ@@MGweight/@primeMS[#]&]

A298479 Matula-Goebel numbers of rooted trees in which all positive outdegrees are different.

Original entry on oeis.org

1, 2, 4, 6, 7, 8, 12, 16, 19, 24, 28, 32, 38, 42, 48, 52, 53, 56, 57, 64, 68, 74, 84, 96, 104, 106, 107, 112, 128, 131, 134, 136, 152, 159, 163, 168, 178, 192, 208, 212, 224, 228, 256, 262, 263, 272, 296, 304, 311, 318, 336, 356, 384, 393, 416, 446, 448, 456
Offset: 1

Views

Author

Gus Wiseman, Jan 19 2018

Keywords

Examples

			Sequence of trees begins:
1  o
2  (o)
4  (oo)
6  (o(o))
7  ((oo))
8  (ooo)
12 (oo(o))
16 (oooo)
19 ((ooo))
24 (ooo(o))
28 (oo(oo))
32 (ooooo)
38 (o(ooo))
42 (o(o)(oo))
48 (oooo(o))
52 (oo(o(o)))
53 ((oooo))
56 (ooo(oo))
57 ((o)(ooo))
64 (oooooo)
68 (oo((oo)))
74 (o(oo(o)))
84 (oo(o)(oo))
96 (ooooo(o))

Crossrefs

Cf. A000081, A001221, A004111, A007097, A032305, A061775, A111299, A276625, A290760, A297571, A298120, A298422, A298424, A298478.

Programs

  • Mathematica
    MGtree[n_]:=If[n===1,{},MGtree/@Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
doQ[n_]:=Or[n===1,UnsameQ@@Length/@Cases[MGtree[n],{},{0,Infinity}]];
Select[Range[1000],doQ]

A324842 Matula-Goebel numbers of rooted trees where the branches of any branch of any terminal subtree form a submultiset of the branches of the same subtree.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 16, 18, 24, 28, 32, 36, 48, 54, 56, 64, 72, 78, 84, 96, 108, 112, 128, 144, 152, 156, 162, 168, 192, 196, 216, 224, 234, 252, 256, 288, 304, 312, 324, 336, 384, 392, 432, 444, 448, 456, 468, 486, 504, 512, 576, 588, 608, 624, 648, 672, 702
Offset: 1

Views

Author

Gus Wiseman, Mar 18 2019

Keywords

Examples

			The sequence of rooted trees together with their Matula-Goebel numbers begins:
   1: o
   2: (o)
   4: (oo)
   6: (o(o))
   8: (ooo)
  12: (oo(o))
  16: (oooo)
  18: (o(o)(o))
  24: (ooo(o))
  28: (oo(oo))
  32: (ooooo)
  36: (oo(o)(o))
  48: (oooo(o))
  54: (o(o)(o)(o))
  56: (ooo(oo))
  64: (oooooo)
  72: (ooo(o)(o))
  78: (o(o)(o(o)))
  84: (oo(o)(oo))
  96: (ooooo(o))

Crossrefs

A subsequence of A120383.
Cf. A000081, A007097, A112798, A279861, A290689, A290760, A290822, A318186.
Cf. A324704, A324736, A324748, A324753, A324843, A324847, A324848, A324854.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
qaQ[n_]:=And[And@@Table[Divisible[n,x],{x,primeMS[n]}],And@@qaQ/@primeMS[n]];
Select[Range[1000],qaQ]

A298540 Matula-Goebel numbers of rooted trees such that every branch of the root has a different number of nodes.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, 31, 33, 34, 37, 38, 39, 41, 42, 43, 46, 47, 51, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 71, 73, 74, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 101, 102, 103, 106, 107, 109
Offset: 1

Views

Author

Gus Wiseman, Jan 21 2018

Keywords

Examples

			Sequence of trees begins:
1  o
2  (o)
3  ((o))
5  (((o)))
6  (o(o))
7  ((oo))
10 (o((o)))
11 ((((o))))
13 ((o(o)))
14 (o(oo))
15 ((o)((o)))
17 (((oo)))
19 ((ooo))
21 ((o)(oo))
22 (o(((o))))
23 (((o)(o)))
26 (o(o(o)))
29 ((o((o))))
30 (o(o)((o)))

Crossrefs

Cf. A000081, A007097, A061775, A111299, A214577, A276625, A290760, A291442, A297571, A298479, A298534, A298536, A298538, A298539.

Programs

  • Mathematica
    nn=500;
primeMS[n_]:=If[n===1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
MGweight[n_]:=If[n===1,1,1+Total[MGweight/@primeMS[n]]];
Select[Range[nn],UnsameQ@@MGweight/@primeMS[#]&]

A298363 Matula-Goebel numbers of rooted identity trees with thinning limbs.

Original entry on oeis.org

1, 2, 3, 5, 6, 10, 11, 15, 22, 26, 30, 31, 33, 39, 55, 58, 62, 65, 66, 78, 87, 93, 94, 110, 127, 130, 141, 143, 145, 155, 158, 165, 174, 186, 195, 202, 235, 237, 254, 274, 282, 286, 290, 303, 310, 319, 330, 334, 341, 377, 381, 390, 395, 403, 411, 429, 435, 465
Offset: 1

Views

Author

Gus Wiseman, Jan 17 2018

Keywords

Comments

An unlabeled rooted tree has thinning limbs if its outdegrees are weakly decreasing from root to leaves.

Examples

			Sequence of trees begins:
1  o
2  (o)
3  ((o))
5  (((o)))
6  (o(o))
10 (o((o)))
11 ((((o))))
15 ((o)((o)))
22 (o(((o))))
26 (o(o(o)))
30 (o(o)((o)))
31 (((((o)))))
33 ((o)(((o))))
39 ((o)(o(o)))
55 (((o))(((o))))
58 (o(o((o))))
62 (o((((o)))))
65 (((o))(o(o)))
66 (o(o)(((o))))
78 (o(o)(o(o)))
87 ((o)(o((o))))
93 ((o)((((o)))))
94 (o((o)((o))))

Crossrefs

Cf. A000081, A004111, A007097, A061775, A111299, A124343, A124346, A214577, A276625, A277098, A290689, A290760, A298304, A298305.

Programs

  • Mathematica
    MGtree[n_]:=If[n===1,{},MGtree/@Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
idthinQ[t_]:=And@@Cases[t,b_List:>UnsameQ@@b&&Length[b]>=Max@@Length/@b,{0,Infinity}];
Select[Range[500],idthinQ[MGtree[#]]&]

Formula

Intersection of A276625 and A298303.
Previous Showing 21-27 of 27 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.