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.

A071266 Smallest numbers which can be written in exactly n different ways as k + R(k) where R(k) is k reversed (A004086).

Original entry on oeis.org

1, 0, 22, 44, 66, 88, 1111, 1661, 1771, 1881, 1991, 2662, 2772, 4444, 2882, 2992, 3773
Offset: 0

Views

Author

Amarnath Murthy, Jun 01 2002

Keywords

Comments

a(17), if it exists, exceeds 10^10. - Sean A. Irvine, Jul 06 2024

Examples

			a(0) = 1, since 1 cannot be written as k + R(k); a(1) = 0, since 0 = k + R(k) for k = 0.
a(4) = 66 and the four partitions are (60,06),(51,15),(42,24),(33,33).
		

Extensions

More terms from Klaus Brockhaus, Jun 05 2002