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 A301768 #4 Mar 26 2018 20:03:59
%S A301768 1,1,2,2,4,3,6,5,11,8,14,11,32,16,36,32,70,33,104,47,168,130,178,90,
%T A301768 521,155,369,383,902,223,1562,297,1952,1392,1474,1665,6297,669,2878,
%U A301768 4241,12401,1114,17474,1427,19436,20754,9971,2305,80110,19295,51942,36428
%N A301768 Number of ways to choose a strict rooted partition of each part in a constant rooted partition of n.
%C A301768 A rooted partition of n is an integer partition of n - 1.
%e A301768 The a(9) = 11 rooted twice-partitions:
%e A301768 (7), (61), (52), (43), (421),
%e A301768 (3)(3), (3)(21), (21)(3), (21)(21),
%e A301768 (1)(1)(1)(1),
%e A301768 ()()()()()()()().
%t A301768 Table[Sum[PartitionsQ[n/d-1]^d,{d,Divisors[n]}],{n,50}]
%Y A301768 Cf. A002865, A063834, A093637, A127524, A279788, A296132, A301422, A301462, A301467, A301480, A301706.
%K A301768 nonn
%O A301768 1,3
%A A301768 _Gus Wiseman_, Mar 26 2018