login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A341206 Number of ways to write n as an ordered sum of 9 nonzero decimal palindromes. 6

%I #10 Feb 07 2021 13:14:12

%S 1,9,45,165,495,1287,3003,6435,12870,24301,43686,75249,124809,200115,

%T 311157,470415,693000,996633,1401436,1929465,2603979,3448440,4485267,

%U 5734395,7211718,8927523,10885050,13079257,15496065,18112050,20894757,23803659,26791749,29807697,32798448

%N Number of ways to write n as an ordered sum of 9 nonzero decimal palindromes.

%H Alois P. Heinz, <a href="/A341206/b341206.txt">Table of n, a(n) for n = 9..10000</a>

%p p:= proc(n) option remember; local i, s; s:= ""||n;

%p for i to iquo(length(s), 2) do if

%p s[i]<>s[-i] then return false fi od; true

%p end:

%p b:= proc(n, t) option remember; `if`(n=0, `if`(t=0, 1, 0),

%p `if`(t<1, 0, add(`if`(p(j), b(n-j, t-1), 0), j=1..n)))

%p end:

%p a:= n-> b(n, 9):

%p seq(a(n), n=9..43); # _Alois P. Heinz_, Feb 07 2021

%t nmax = 43; CoefficientList[Series[Sum[Boole[PalindromeQ[k]] x^k, {k, 1, nmax}]^9, {x, 0, nmax}], x] // Drop[#, 9] &

%Y Cf. A002113, A136522, A319474, A341167, A341184, A341191, A341192, A341193, A341203, A341204, A341205, A341207.

%K nonn,base

%O 9,2

%A _Ilya Gutkovskiy_, Feb 06 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 06:30 EDT 2024. Contains 375530 sequences. (Running on oeis4.)