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-2 of 2 results.

A091584 Number of partitions of the n-th decimal palindrome into decimal palindromes.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 55, 788, 5747, 28915, 114064, 378823, 1105429, 2916219, 7093435, 8275126, 17341313, 34721974, 66837990, 124308827, 224290376, 393929311, 675393430, 1133103539, 1864009161, 3157186031, 5011108578, 7836124010, 12086660443
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 22 2004

Keywords

Comments

a(n) = A091580(A002113(n)).

Crossrefs

Extensions

More terms from Alois P. Heinz, Nov 13 2018

A309325 Numbers that are the sum of two successive palindromes.

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 13, 15, 17, 20, 33, 55, 77, 99, 121, 143, 165, 187, 200, 212, 232, 252, 272, 292, 312, 332, 352, 372, 393, 414, 434, 454, 474, 494, 514, 534, 554, 574, 595, 616, 636, 656, 676, 696, 716, 736, 756, 776, 797, 818, 838, 858, 878, 898, 918, 938, 958, 978
Offset: 1

Views

Author

Ilya Gutkovskiy, Jul 23 2019

Keywords

Crossrefs

Programs

  • Mathematica
    Total /@ Partition[Select[Range[0, 500], PalindromeQ], 2, 1]
  • Python
    from itertools import chain, count, islice
    def A309325_gen(): # generator of terms
        c = 0
        for a in chain.from_iterable(chain((int((s:=str(d))+s[-2::-1]) for d in range(10**l,10**(l+1))), (int((s:=str(d))+s[::-1]) for d in range(10**l,10**(l+1)))) for l in count(0)):
            yield c+(c:=a)
    A309325_list = list(islice(A309325_gen(),20)) # Chai Wah Wu, Jun 23 2022

Formula

a(n) = A002113(n) + A002113(n+1).
Showing 1-2 of 2 results.