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 A282845 #16 Feb 16 2025 08:33:42
%S A282845 0,0,0,0,0,0,1,6,21,56,126,246,432,702,1077,1576,2232,3072,4112,5352,
%T A282845 6801,8422,10197,12102,14117,16146,18177,20112,21882,23382,24661,
%U A282845 25566,26136,26316,26181,25560,24677,23436,21981,20226,18486,16536,14642,12702,10962,9166,7662,6222,5042,3912,3096,2306,1746,1236,921,600
%N A282845 Number of ways to write n as an ordered sum of 6 prime power palindromes (A084092).
%C A282845 Is there k which satisfies a(n) > 0 for all n > k?
%H A282845 Ilya Gutkovskiy, <a href="/A282845/a282845.pdf">Extended graphical example</a>
%H A282845 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimePower.html">Prime Power</a>
%H A282845 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PalindromicNumber.html">Palindromic Number</a>
%H A282845 <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>
%F A282845 G.f.: (Sum_{k>=1} x^A084092(k))^6.
%e A282845 a(7) = 6 because we have:
%e A282845 [2, 1, 1, 1, 1, 1]
%e A282845 [1, 2, 1, 1, 1, 1]
%e A282845 [1, 1, 2, 1, 1, 1]
%e A282845 [1, 1, 1, 2, 1, 1]
%e A282845 [1, 1, 1, 1, 2, 1]
%e A282845 [1, 1, 1, 1, 1, 2]
%t A282845 nmax = 55; CoefficientList[Series[(x + Sum[Boole[PrimePowerQ[k] && PalindromeQ[k]] x^k, {k, 1, nmax}])^6, {x, 0, nmax}], x]
%Y A282845 Cf. A000961, A002113, A002385, A084092, A260254, A261131, A261132, A261422, A282585.
%K A282845 base,nonn
%O A282845 0,8
%A A282845 _Ilya Gutkovskiy_, Feb 22 2017