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 A375582 #9 Oct 10 2024 15:59:48 %S A375582 1,2,2,2,1,2,1,2,1,1,1,3,2,2,1,2,2,3,2,2,2,3,1,2,1,3,1,4,4,4,3,4,2,3, %T A375582 2,3,1,4,3,4,3,3,4,3,2,2,2,3,2,3,2,3,3,3,5,6,4,5,3,5,3,3,2,5,4,5,4,5, %U A375582 3,5,2,3,3,5,2,4,3,3,2,6,4,6,4,5,4,5,4,5,4,6,6,6,4,6 %N A375582 a(n) is the number of ways n can be written as a sum of a practical number and two decagonal numbers. %C A375582 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 A375582 Duc Van Khanh Tran, <a href="/A375582/b375582.txt">Table of n, a(n) for n = 1..10000</a> %H A375582 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 A375582 Cf. A001107, A005153. %K A375582 nonn %O A375582 1,2 %A A375582 _Duc Van Khanh Tran_, Aug 19 2024