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.

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.

This page as a plain text file.
%I A324842 #5 Mar 19 2019 07:14:52
%S A324842 1,2,4,6,8,12,16,18,24,28,32,36,48,54,56,64,72,78,84,96,108,112,128,
%T A324842 144,152,156,162,168,192,196,216,224,234,252,256,288,304,312,324,336,
%U A324842 384,392,432,444,448,456,468,486,504,512,576,588,608,624,648,672,702
%N 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.
%e A324842 The sequence of rooted trees together with their Matula-Goebel numbers begins:
%e A324842    1: o
%e A324842    2: (o)
%e A324842    4: (oo)
%e A324842    6: (o(o))
%e A324842    8: (ooo)
%e A324842   12: (oo(o))
%e A324842   16: (oooo)
%e A324842   18: (o(o)(o))
%e A324842   24: (ooo(o))
%e A324842   28: (oo(oo))
%e A324842   32: (ooooo)
%e A324842   36: (oo(o)(o))
%e A324842   48: (oooo(o))
%e A324842   54: (o(o)(o)(o))
%e A324842   56: (ooo(oo))
%e A324842   64: (oooooo)
%e A324842   72: (ooo(o)(o))
%e A324842   78: (o(o)(o(o)))
%e A324842   84: (oo(o)(oo))
%e A324842   96: (ooooo(o))
%t A324842 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A324842 qaQ[n_]:=And[And@@Table[Divisible[n,x],{x,primeMS[n]}],And@@qaQ/@primeMS[n]];
%t A324842 Select[Range[1000],qaQ]
%Y A324842 A subsequence of A120383.
%Y A324842 Cf. A000081, A007097, A112798, A279861, A290689, A290760, A290822, A318186.
%Y A324842 Cf. A324704, A324736, A324748, A324753, A324843, A324847, A324848, A324854.
%K A324842 nonn
%O A324842 1,2
%A A324842 _Gus Wiseman_, Mar 18 2019