cp's OEIS Frontend

A306202 Matula-Goebel numbers of rooted semi-identity trees.

%I A306202 #8 Jun 25 2021 23:41:26
%S A306202 1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,19,20,21,22,24,26,28,29,30,
%T A306202 31,32,33,34,35,37,38,39,40,41,42,43,44,47,48,51,52,53,55,56,57,58,59,
%U A306202 60,62,64,65,66,67,68,70,71,73,74,76,77,78,79,80,82,84,85
%N A306202 Matula-Goebel numbers of rooted semi-identity trees.
%C A306202 Definition: A positive integer belongs to the sequence iff its prime indices greater than 1 are distinct and already belong to the sequence. A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
%H A306202 <a href="/index/Mat#matula">Index entries for sequences related to Matula-Goebel numbers</a>
%e A306202 The sequence of all unlabeled rooted semi-identity trees together with their Matula-Goebel numbers begins:
%e A306202    1: o
%e A306202    2: (o)
%e A306202    3: ((o))
%e A306202    4: (oo)
%e A306202    5: (((o)))
%e A306202    6: (o(o))
%e A306202    7: ((oo))
%e A306202    8: (ooo)
%e A306202   10: (o((o)))
%e A306202   11: ((((o))))
%e A306202   12: (oo(o))
%e A306202   13: ((o(o)))
%e A306202   14: (o(oo))
%e A306202   15: ((o)((o)))
%e A306202   16: (oooo)
%e A306202   17: (((oo)))
%e A306202   19: ((ooo))
%e A306202   20: (oo((o)))
%e A306202   21: ((o)(oo))
%e A306202   22: (o(((o))))
%e A306202   24: (ooo(o))
%e A306202   26: (o(o(o)))
%e A306202   28: (oo(oo))
%e A306202   29: ((o((o))))
%e A306202   30: (o(o)((o)))
%t A306202 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A306202 psidQ[n_]:=And[UnsameQ@@DeleteCases[primeMS[n],1],And@@psidQ/@primeMS[n]];
%t A306202 Select[Range[100],psidQ]
%Y A306202 Cf. A000081, A004111, A007097, A276625, A277098, A306200, A306201, A316467.
%K A306202 nonn
%O A306202 1,2
%A A306202 _Gus Wiseman_, Jan 29 2019