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 A301763 #8 Aug 27 2018 01:52:37
%S A301763 1,1,2,3,4,4,8,5,8,13,14,5,32,7,20,64,26,6,92,7,126,199,22,5,352,252,
%T A301763 41,581,394,7,1832,9,292,2119,31,3216,4946,10,40,8413,7708,9,20656,9,
%U A301763 2324,53546,24,5,70040,16395,59361,131204,9503,7,266780,178180,82086
%N A301763 Number of ways to choose a constant rooted partition of each part in a constant rooted partition of n.
%C A301763 A rooted partition of n is an integer partition of n - 1.
%H A301763 Andrew Howroyd, <a href="/A301763/b301763.txt">Table of n, a(n) for n = 1..1000</a>
%e A301763 The a(7) = 8 rooted twice-partitions: (5), (11111), (2)(2), (2)(11), (11)(2), (11)(11), (1)(1)(1), ()()()()()().
%e A301763 The a(15) = 20 rooted twice-partitions:
%e A301763 ()()()()()()()()()()()()()(),
%e A301763 (1)(1)(1)(1)(1)(1)(1), (111111)(111111), (1111111111111),
%e A301763 (111111)(222), (222)(111111), (222)(222),
%e A301763 (111111)(33), (222)(33), (33)(111111), (33)(222), (33)(33),
%e A301763 (111111)(6), (222)(6), (33)(6), (6)(111111), (6)(222), (6)(33), (6)(6),
%e A301763 (13).
%t A301763 Table[If[n===1,1,Sum[If[d===n-1,1,DivisorSigma[0,(n-1)/d-1]]^d,{d,Divisors[n-1]}]],{n,50}]
%o A301763 (PARI) a(n)=if(n==1, 1, sumdiv(n-1, d, if(d==n-1, 1, numdiv((n-1)/d-1)^d))) \\ _Andrew Howroyd_, Aug 26 2018
%Y A301763 Cf. A000005, A002865, A047968, A063834, A093637, A127524, A295924, A300383, A301422, A301462, A301467, A301480, A301706.
%K A301763 nonn
%O A301763 1,3
%A A301763 _Gus Wiseman_, Mar 26 2018