cp's OEIS Frontend

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.

A341165 Number of partitions of n into 7 distinct nonzero decimal palindromes.

This page as a plain text file.
%I A341165 #9 Feb 06 2021 14:29:37
%S A341165 1,1,2,2,4,4,6,7,8,8,10,9,10,9,9,8,8,7,7,7,8,9,10,11,13,14,16,17,18,
%T A341165 18,19,19,20,19,19,19,19,19,19,19,19,19,20,21,21,22,24,25,28,29,32,33,
%U A341165 36,37,40,39,41,41,42,42,42,42,42,42,43,44,43,45,47,48
%N A341165 Number of partitions of n into 7 distinct nonzero decimal palindromes.
%H A341165 Alois P. Heinz, <a href="/A341165/b341165.txt">Table of n, a(n) for n = 28..20000</a>
%p A341165 p:= proc(n) option remember; local i, s; s:= ""||n;
%p A341165       for i to iquo(length(s), 2) do if
%p A341165         s[i]<>s[-i] then return false fi od; true
%p A341165     end:
%p A341165 h:= proc(n) option remember; `if`(n<1, 0,
%p A341165      `if`(p(n), n, h(n-1)))
%p A341165     end:
%p A341165 b:= proc(n, i, t) option remember; `if`(n=0, 1, `if`(t*i<n,
%p A341165       0, b(n, h(i-1), t)+b(n-i, h(min(n-i, i-1)), t-1)))
%p A341165     end:
%p A341165 a:= n-> (k-> b(n, h(n), k)-b(n, h(n), k-1))(7):
%p A341165 seq(a(n), n=28..97);  # _Alois P. Heinz_, Feb 06 2021
%Y A341165 Cf. A002113, A136522, A319472, A341155, A341156, A341157, A341158, A341159, A341166, A341167, A341168.
%K A341165 nonn,base
%O A341165 28,3
%A A341165 _Ilya Gutkovskiy_, Feb 06 2021