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.

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

Original entry on oeis.org

0, 8, 50, 352, 282475258, 232630513987258, 418377847259091645147530834859099334519176045887014771594
Offset: 1

Views

Author

N. J. A. Sloane, Mar 19 2014

Keywords

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.