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.

A081928 Sum of the n smallest numbers having the sum of their digits equal to n.

Original entry on oeis.org

1, 13, 36, 70, 115, 171, 238, 316, 405, 604, 868, 1197, 1591, 2158, 2844, 3829, 5140, 6939, 9415, 12100, 14994, 18493, 26062, 34650, 49414, 69535, 96534, 129412, 164299, 201195, 240154, 281122, 414036, 584635, 852634, 1212633, 1629532
Offset: 1

Views

Author

Amarnath Murthy, Apr 01 2003

Keywords

Comments

Sum of n-th row of A081926.

Examples

			The two smallest numbers with digit sum 2 are 2 and 11, whose sum is 13.
For seven, 7+16+25+34+43+52+61=238.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Module[{}, co = 0; in = 1; su = 0; While[co < n, If[Plus @@ IntegerDigits[in] == n, co++; su = su + in]; in++ ]; su]; Table[a[n], {n, 1, 30}] (Steinerberger)

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003
Edited by N. J. A. Sloane, Jul 02 2008 at the suggestion of R. J. Mathar