login
A375582
a(n) is the number of ways n can be written as a sum of a practical number and two decagonal numbers.
2
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, 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, 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
OFFSET
1,2
COMMENTS
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.
LINKS
Sai Teja Somu and Duc Van Khanh Tran, On sums of practical numbers and polygonal numbers, Journal of Integer Sequences, 27(5), 2024.
CROSSREFS
Sequence in context: A232654 A105971 A375583 * A280314 A080354 A374416
KEYWORD
nonn
AUTHOR
Duc Van Khanh Tran, Aug 19 2024
STATUS
approved