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.

A233032 Numbers k such that the equation x + (sum of digits of x) = 10^k has two solutions.

Original entry on oeis.org

12, 23, 34, 45, 58, 69, 80, 91, 102, 112, 113, 123, 134, 145, 158, 169, 180, 191, 202, 213, 223, 224, 234, 245, 258, 269, 280, 291, 302, 313, 324, 334, 335, 345, 358, 369, 380, 391, 402, 413, 424, 435, 445, 458, 469, 480, 491, 502, 513, 524, 535, 546, 559, 569, 580, 591, 602, 613, 624, 635, 646, 659, 669, 670, 680, 691, 702
Offset: 1

Views

Author

Max Alekseyev, Dec 03 2013

Keywords

Examples

			For k=12, the two solutions are 999999999896 and 999999999905, for which we have A062028(999999999896) = A062028(999999999905) = 10^12.
		

Crossrefs