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.

A272029 Least number k > n such that the multiplicative and additive digital roots of k are both equal to n.

Original entry on oeis.org

1111111111, 137, 1111111113, 22, 1157, 123, 1111111117, 179, 11133
Offset: 1

Views

Author

Altug Alkan, Jul 13 2016

Keywords

Comments

Sequence is trivially finite by definition.
How is the distribution of corresponding digital roots in A064702? This sequence is the result of related observation in limited range.

Examples

			a(5) = 1157 because 1+1+5+7 = 14, 1+4 = 5 and 1*1*5*7 = 35, 3*5 = 15, 1*5 = 5. 1157 is the least number that is greater than 5 with this property.
		

Crossrefs