%I
%S 1,1,2,1,3,2,4,1,4,3,5,2,6,4,6,1,5,4,8,3,8,5,9,2,9,6,8,4,10,6,8,1,10,
%T 5,12,4,12,8,12,3,8,8,10,5,12,9,15,2,16,9,10,6,16,8,15,4,16,10,9,6,18,
%U 8,16,1,18,10,9,5,18,12,20,4,15,12,18,8,20,12
%N Number of independent subsets in the rooted tree with MatulaGoebel number n that contain the root.
%C A184165(n) = a(n) + A228732(n);
%C this sequence and A228732 are defined by a pair of mutually recursive functions, see A184165 for definition (called b and c there).
%H Reinhard Zumkeller, <a href="/A228731/b228731.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Mat#matula">Index entries for sequences related to MatulaGoebel numbers</a>
%F Completely multiplicative with a(prime(t)) = A228732(t).  _Andrew Howroyd_, Aug 01 2018
%o (Haskell) see A184165.
%Y Cf. A184165, A228732.
%K nonn,mult
%O 1,3
%A _Emeric Deutsch_ and _Reinhard Zumkeller_, Sep 01 2013
