login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081928 Sum of the n smallest numbers having the sum of their digits equal to n. 2

%I #7 Feb 20 2018 15:00:41

%S 1,13,36,70,115,171,238,316,405,604,868,1197,1591,2158,2844,3829,5140,

%T 6939,9415,12100,14994,18493,26062,34650,49414,69535,96534,129412,

%U 164299,201195,240154,281122,414036,584635,852634,1212633,1629532

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

%C Sum of n-th row of A081926.

%e The two smallest numbers with digit sum 2 are 2 and 11, whose sum is 13.

%e For seven, 7+16+25+34+43+52+61=238.

%t 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)

%Y Cf. A081926, A081927, A051865.

%K base,easy,nonn

%O 1,2

%A _Amarnath Murthy_, Apr 01 2003

%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003

%E Edited by _N. J. A. Sloane_, Jul 02 2008 at the suggestion of _R. J. Mathar_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)