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.

Showing 1-1 of 1 results.

A070840 Repdigits (A010785) ordered by sum of digits (A007953).

Original entry on oeis.org

0, 1, 2, 11, 3, 111, 4, 22, 1111, 5, 11111, 6, 33, 222, 111111, 7, 1111111, 8, 44, 2222, 11111111, 9, 333, 111111111, 55, 22222, 1111111111, 11111111111, 66, 444, 3333, 222222, 111111111111, 1111111111111, 77, 2222222, 11111111111111, 555, 33333
Offset: 1

Views

Author

Amarnath Murthy, May 12 2002

Keywords

Comments

If n has no divisors among 2,3,5 or 7 then the only term with digit sum n is the repunit A002275(n) = 1111... n times.

Crossrefs

Cf. A070841.

Extensions

Edited and extended by Ray Chandler, Feb 10 2009
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.