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 A373687 #6 Jul 05 2024 17:09:05 %S A373687 1,2,2,2,1,3,3,3,2,2,2,3,3,5,1,3,3,6,3,3,4,3,3,5,6,5,1,6,6,7,4,4,5,4, %T A373687 5,6,6,6,3,7,7,10,5,5,5,6,5,8,4,5,4,9,8,8,7,7,5,8,8,9,4,6,6,11,8,8,7, %U A373687 7,6,6,9,12,5,8,8,12,10,8,9,7 %N A373687 a(n) is the number of ways n can be written as a sum of a practical number and two pentagonal numbers. %C A373687 Somu and Tran (2024) proved that a(n) > 0 for sufficiently large n and conjectured that a(n) > 0 for all n > 0. The conjecture was checked up to 10^8. %H A373687 Duc Van Khanh Tran, <a href="/A373687/b373687.txt">Table of n, a(n) for n = 1..10000</a> %H A373687 Sai Teja Somu and Duc Van Khanh Tran, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL27/Somu/somu5.html">On sums of practical numbers and polygonal numbers</a>, Journal of Integer Sequences, 27(5), 2024. %Y A373687 Cf. A000326, A005153. %K A373687 nonn %O A373687 1,2 %A A373687 _Duc Van Khanh Tran_, Jun 13 2024