Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #14 Jul 15 2022 02:37:50
%S 0,1,1,2,1,2,2,3,2,2,1,3,2,2,2,4,2,3,3,3,2,2,2,4,2,2,3,3,2,3,1,5,2,2,
%T 2,4,3,3,2,4,2,3,2,3,3,2,2,5,2,3,2,3,4,4,2,4,3,2,2,4,3,2,3,6,2,3,3,3,
%U 2,3,3,5,2,3,3,3,2,3,2,5,4,2,2,4,2,2,2
%N Largest number of children of any vertex in the rooted tree with Matula-Goebel number n.
%C Record highs are at a(2^k) = k which is a root with k singleton children.
%C A new root above a tree has a single child (the old root) so no change to the largest number of children, except when above a singleton, so that a(prime(n)) = a(n) for n >= 2.
%C Terms a(n) <= 1 are paths down (all vertices 0 or 1 children), which are the primeth recurrence n = A007097.
%H Kevin Ryde, <a href="/A355661/b355661.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Mat#matula">Index entries for sequences related to Matula-Goebel numbers</a>
%F a(n) = max(bigomega(n), {a(primepi(p)) | p prime factor of n}).
%F a(n) = Max_{s in row n of A354322} bigomega(s).
%e For n=629, tree 629 is as follows and vertex 12 has 3 children which is the most of any vertex so that a(629) = 3.
%e 629 root
%e / \
%e 7 12 tree n=629 and its
%e | /|\ subtree numbers
%e 4 1 1 2
%e / \ |
%e 1 1 1
%p a:= proc(n) option remember; uses numtheory;
%p max(bigomega(n), map(p-> a(pi(p)), factorset(n))[])
%p end:
%p seq(a(n), n=1..100); # _Alois P. Heinz_, Jul 14 2022
%t nn = 105; a[1] = 0; a[2] = 1; Do[a[n] = Max@ Append[Map[a[PrimePi[#]] &, FactorInteger[n][[All, 1]]], PrimeOmega[n]], {n, 3, nn}]; Array[a, nn] (* _Michael De Vlieger_, Jul 14 2022 *)
%o (PARI) a(n) = my(f=factor(n)); vecmax(concat(vecsum(f[,2]), [self()(primepi(p)) |p<-f[,1]]));
%Y Cf. A001222 (bigomega), A354322 (distinct subtrees).
%Y Cf. A007097 (indices of <=1).
%Y Cf. A355662 (minimum children).
%K nonn
%O 1,4
%A _Kevin Ryde_, Jul 14 2022