Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Sep 17 2018 17:59:22
%S 1,1,1,2,2,3,4,5,6,8,9,11,13,14,17,19,21,23,26,27,30,32,34,36,37,39,
%T 40,42,42,44,44,45,45,47,47,47,49,48,50,50,52,52,55,55,58,60,60,64,65,
%U 68,69,73,73,77,78,82,84,84,88,88,92,92,96,96,100,100,105,107,107,113
%N Number of partitions of n into distinct decimal palindromes.
%C Not the same as A088670: a(n) > A088670(n) for n > 101.
%H Alois P. Heinz, <a href="/A091581/b091581.txt">Table of n, a(n) for n = 0..20000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PalindromicNumber.html">Palindromic Number</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Partition.html">Partition</a>
%e n=13: there are A000009(13)=18 partitions of 13 into distinct integers, 4 of them contain non-palindromes: 13=12+1, 13=10+3, 13=10+2+1 and 13 itself, therefore a(13)=18-4=14;
%e for n=14 there are a(14)=17 partitions into palindromes: 11+3 = 11+2+1 = 9+5 = 9+4+1 = 9+3+2 = 8+6 = 8+5+1 = 8+4+2 = 8+3+2+1 = 7+6+1 = 7+5+2 = 7+4+3 = 7+4+2+1 = 6+5+3 = 6+5+2+1 = 6+4+3+1 = 5+4+3+2.
%Y Cf. A091580, A046489.
%K nonn,base
%O 0,4
%A _Reinhard Zumkeller_, Jan 22 2004
%E a(0)=1 prepended by _Alois P. Heinz_, Sep 17 2018