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 A374344 #22 Jul 31 2024 00:29:54 %S A374344 1,2,2,2,1,2,1,3,3,2,1,2,2,2,2,3,1,3,3,6,2,3,2,3,3,5,3,2,2,4,4,4,2,3, %T A374344 3,5,6,6,3,4,3,7,6,4,2,3,4,4,5,5,2,2,4,6,5,7,5,5,4,5,6,5,4,7,4,6,6,7, %U A374344 2,5,4,7,6,9,4,5,3,5,6,8 %N A374344 a(n) is the number of ways n can be written as a sum of a practical number and two heptagonal numbers. %C A374344 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 A374344 Duc Van Khanh Tran, <a href="/A374344/b374344.txt">Table of n, a(n) for n = 1..10000</a> %H A374344 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 A374344 Cf. A000566, A005153. %K A374344 nonn %O A374344 1,2 %A A374344 _Duc Van Khanh Tran_, Jul 08 2024