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.

A180012 a(n) = smallest k >= 1 such that k and k*n have the same digit sum.

Original entry on oeis.org

1, 9, 9, 3, 9, 9, 3, 9, 9, 1, 99, 9, 9, 9, 9, 9, 9, 9, 6, 9, 54, 6, 9, 9, 6, 9, 9, 4, 9, 9, 33, 36, 99, 3, 9, 9, 3, 9, 9, 3, 27, 27, 24, 99, 9, 5, 9, 9, 9, 9, 63, 6, 27, 45, 2, 9, 9, 9, 9, 9, 33, 18, 18, 5, 18, 99, 3, 9, 9, 3, 72, 45, 7, 18, 18, 15, 99, 9, 9, 9, 63, 5, 27, 18, 6, 27, 36, 15, 9, 9, 11
Offset: 1

Views

Author

David W. Wilson, Aug 06 2010

Keywords

Examples

			For all 1 < k < 99, k and 11*k have distinct digit sum. 99 and 99*11 = 1089 have the same digit sum 18. Therefore a(11) = 99.