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.

A179988 Smallest m such that n = sum of digits of A108971(m).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 26, 29, 46, 49, 66, 69, 86, 89, 176, 273, 376, 473, 576, 673, 776, 873, 976, 1773, 2776, 3773, 4776, 5773, 6776, 7773, 8776, 9773, 17776, 27773, 37776
Offset: 1

Views

Author

Reinhard Zumkeller, Aug 09 2010

Keywords

Comments

A179987(a(n)) = n and A179987(m) <> n for m < a(n);
A108971(a(n)) = A051885(n+1);
A007953(A108971(a(n))) = n;
conjecture for n>=18: a(n) = A051885(n+1) + 7*(10^floor(n/9) - 1)/9 - 3*(n mod 2).