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