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