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.

Table of values

n a(n)
1 1111111111
2 137
3 1111111113
4 22
5 1157
6 123
7 1111111117
8 179
9 11133

List of values

[1111111111, 137, 1111111113, 22, 1157, 123, 1111111117, 179, 11133]