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.

A238840 Smallest number m such that u + (sum of base-6 digits of u) = m has exactly n solutions.

Original entry on oeis.org

0, 37, 10077697, 2821109907494
Offset: 1

Views

Author

N. J. A. Sloane, Mar 19 2014

Keywords

Comments

The next term is a(5) = 6^((6^9+6^2+8)/5) + 38 = 6^2015548 + 38 and is too large to display.

Crossrefs

Smallest number m such that u + (sum of base-b digits of u) = m has exactly n solutions, for bases 2 through 10: A230303, A230640, A230638, A230867, A238840, A238841, A238842, A238843, A006064.