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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061425 Sum of digits = 8 times number of digits. 19

%I #9 Dec 07 2020 01:28:43

%S 8,79,88,97,699,789,798,879,888,897,969,978,987,996,5999,6899,6989,

%T 6998,7799,7889,7898,7979,7988,7997,8699,8789,8798,8879,8888,8897,

%U 8969,8978,8987,8996,9599,9689,9698,9779,9788,9797,9869,9878,9887,9896,9959

%N Sum of digits = 8 times number of digits.

%H Robert Israel, <a href="/A061425/b061425.txt">Table of n, a(n) for n = 1..10000</a>

%e 879 is a term as the arithmetic mean of the digits is (8+7+9)/3 = 8.

%p Q:= proc(n,t) option remember; local j,R;

%p if t > 9*n or t <= 0 then return [] fi;

%p R:= NULL;

%p for j from 0 to min(t,9) do

%p R:= R, op(map(s -> 10*s+j, procname(n-1,t-j)))

%p od;

%p [R]

%p end proc;

%p for i from 0 to 9 do Q(1,i):= [i] od:

%p seq(op(sort(Q(d,8*d))),d=1..4); # _Robert Israel_, Dec 07 2020

%Y Cf. A061383-A061388, A061423-A061424.

%K nonn,base,easy

%O 1,1

%A _Amarnath Murthy_, May 03 2001

%E More terms from Larry Reeves (larryr(AT)acm.org), May 16 2001

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.

Last modified December 9 12:57 EST 2023. Contains 367690 sequences. (Running on oeis4.)