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.

A276354 Palindromes n > 0 such that the sum of all distinct permutations of the digits of n is also a palindrome.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111, 121, 131, 141, 151, 161, 171, 191, 202, 212, 222, 232, 242, 252, 272, 303, 313, 323, 333, 353, 404, 414, 434, 444, 515, 555, 666, 777, 787, 868, 888, 949, 999, 1001, 1111, 1221, 2002, 2112, 2222, 2992
Offset: 1

Views

Author

Altug Alkan, Sep 05 2016

Keywords

Comments

Values of A002113(n) such that A045876(A002113(n)) is in A002113 (n > 0).
If n has a zero digit then the permutations starting with 0 are included in the sum (i.e., 0010 is taken to be 10, 01 is taken to be 1, etc.).
A010785(n) is an obvious term of this sequence for all n > 0.

Examples

			101 is a term because 11 + 101 + 110 = 222 is also a palindrome.
232 is a term because 223 + 232 + 322 = 777 is also a palindrome.
2002 is a term because 22 + 202 + 220 + 2002 + 2020 + 2200 = 6666 is also a palindrome.
		

Crossrefs

Programs