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.

Showing 1-1 of 1 results.

A091582 Number of partitions of the n-th decimal palindrome.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 56, 1002, 10143, 75175, 451276, 2323520, 10619863, 44108109, 169229875, 214481126, 679903203, 2056148051, 5964539504, 16670689208, 45060624582, 118159068427, 301384802048, 749474411781, 1820701100652, 4714566886083, 10963707205259
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 22 2004

Keywords

Crossrefs

Programs

  • Python
    from sympy import npartitions
    def A091582(n):
        if n == 1: return 1
        y = 10*(x:=10**(len(str(n>>1))-1))
        return npartitions((c:=n-x)*x+int(str(c)[-2::-1]or 0) if nChai Wah Wu, Jun 14 2024

Formula

a(n) = A000041(A002113(n)).

Extensions

a(1)=1 prepended and more terms from Georg Fischer, Dec 15 2020
Showing 1-1 of 1 results.