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