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.
%I A301767 #4 Mar 26 2018 20:03:52
%S A301767 1,1,1,3,4,7,9,15,21,32,45,59,89,117,162,225,309,394,538,707,929,1240,
%T A301767 1613,2055,2677,3517,4439,5724,7288,9222,11671,14809,18480,23226,
%U A301767 29138,36501,45373,56438,69920,86426,106715,131171,161428,197717,242301,295888
%N A301767 Number of ways to choose a constant rooted partition of each part in a strict rooted partition of n.
%C A301767 A rooted partition of n is an integer partition of n - 1.
%F A301767 O.g.f.: Product_{n>0} (1 + d(n-1) x^n) where d(n) = A000005(n) and d(0) = 1.
%e A301767 The a(7) = 9 rooted twice-partitions:
%e A301767 (5), (11111),
%e A301767 (4)(), (22)(), (1111)(), (3)(1), (111)(1),
%e A301767 (2)(1)(), (11)(1)().
%t A301767 Table[Sum[Product[If[k===1,1,DivisorSigma[0,k-1]],{k,ptn}],{ptn,Select[IntegerPartitions[n-1],UnsameQ@@#&]}],{n,50}]
%Y A301767 Cf. A002865, A032305, A063834, A093637, A279786, A296131, A301422, A301462, A301467, A301480, A301706.
%K A301767 nonn
%O A301767 1,4
%A A301767 _Gus Wiseman_, Mar 26 2018