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