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 A116372 #5 Feb 16 2025 08:33:00
%S A116372 0,1,0,1,0,1,0,1,0,1,1,1,1,1,1,1,1,1,1,2,1,3,1,3,1,3,1,3,2,3,3,3,4,3,
%T A116372 4,3,4,4,4,6,4,7,4,8,4,8,5,8,7,8,9,8,10,8,11,9,11,12,11,15,11,17,11,
%U A116372 18,12,19,15,19,19,19,22,19,24,20,25,24,26,29,26,34,26,37,27,39,31,40,38,41
%N A116372 Number of partitions of n into parts with digital root = 2.
%C A116372 a(n) = A114102(n) - A116371(n) - A116373(n) - A116374(n) - A116375(n) - A116376(n) - A116377(n) - A116378(n) - A114099(n).
%H A116372 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DigitalRoot.html">Digital Root</a>
%e A116372 a(31) = #{29+2, 20+11, 11+2+2+2+2+2} = 3.
%Y A116372 Cf. A010888.
%Y A116372 A147706. [From _Reinhard Zumkeller_, Nov 11 2008]
%K A116372 nonn,base
%O A116372 1,20
%A A116372 _Reinhard Zumkeller_, Feb 12 2006