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.

A077491 a(n) = smallest k such that 2k has digit sum = n.

Original entry on oeis.org

5, 1, 6, 2, 7, 3, 8, 4, 9, 14, 19, 24, 29, 34, 39, 44, 49, 99, 149, 199, 249, 299, 349, 399, 449, 499, 999, 1499, 1999, 2499, 2999, 3499, 3999, 4499, 4999, 9999, 14999, 19999, 24999, 29999, 34999, 39999, 44999, 49999, 99999, 149999, 199999, 249999, 299999
Offset: 1

Views

Author

Amarnath Murthy, Nov 07 2002

Keywords

Crossrefs

Formula

a(n) = A069532(n)/2.

Extensions

More terms from Ray Chandler, Jul 28 2003