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.

A261924 Numbers that are the sum of two palindromes of the same length.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 22, 33, 44, 55, 66, 77, 88, 99, 110, 121, 132, 143, 154, 165, 176, 187, 198, 202, 212, 222, 232, 242, 252, 262, 272, 282, 292, 302, 303, 312, 313, 322, 323, 332, 333, 342, 343, 352, 353, 362, 363, 372, 373, 382, 383, 393
Offset: 1

Views

Author

David Applegate and N. J. A. Sloane, Sep 17 2015

Keywords

Comments

Theorem: For a fixed value of d, adding two palindromes of length d in all possible ways produces 19 distinct sums if d=1, and 17*19^floor((d-1)/2) distinct sums if d>1. (The number of palindromes with d digits is 10 if d = 1, otherwise 9*10^floor((d-1)/2).) - N. J. A. Sloane, Dec 06 2015

Links

Crossrefs

Cf. A002113, A261921, A261925, etc.

Extensions

Modified to include the zero palindrome. - N. J. A. Sloane, Dec 06 2015
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.