# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a341191
Showing 1-1 of 1

%I A341191 #7 Feb 07 2021 13:12:18
%S A341191 1,2,3,4,5,6,7,8,9,8,9,8,7,6,5,4,3,2,2,0,1,2,2,2,2,2,2,2,2,2,0,2,2,2,
%T A341191 2,2,2,2,2,2,2,0,3,2,2,2,2,2,2,2,2,2,0,4,2,2,2,2,2,2,2,2,2,0,5,2,2,2,
%U A341191 2,2,2,2,2,2,0,6,2,2,2,2,2,2,2,2,2,0,7,2,2
%N A341191 Number of ways to write n as an ordered sum of 2 nonzero decimal palindromes.
%H A341191 Alois P. Heinz, <a href="/A341191/b341191.txt">Table of n, a(n) for n = 2..20000</a>
%t A341191 nmax = 90; CoefficientList[Series[Sum[Boole[PalindromeQ[k]] x^k, {k, 1, nmax}]^2, {x, 0, nmax}], x] // Drop[#, 2] &
%Y A341191 Cf. A002113, A136522, A260254, A319468, A341155, A341192, A341193.
%K A341191 nonn,base
%O A341191 2,2
%A A341191 _Ilya Gutkovskiy_, Feb 06 2021

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE