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!)
A175675 a(n) = smallest integer m>=n such that sum of digits of n and m is >=10. 1

%I #2 Mar 30 2012 17:26:35

%S 19,9,8,7,6,5,6,7,8,9,18,17,16,15,14,15,16,17,18,19,26,25,24,23,24,25,

%T 26,27,28,29,34,33,32,33,34,35,36,37,38,39,42,41,42,43,44,45,46,47,48,

%U 49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71

%N a(n) = smallest integer m>=n such that sum of digits of n and m is >=10.

%C A007953(n) + A007953(m)>=10.

%e a(0)=19 because 0+1+9=10, a(1)=9 because 1+9=10.

%t Reap[Do[idn=IntegerDigits[n];sn=Plus@@idn;

%t Do[If[10<=sn+Plus@@IntegerDigits[m],Sow[m];Break[]],{m,n,10^5}],{n,0,200}]][[2,1]]

%Y Cf. A007953, A175674.

%K base,nonn

%O 0,1

%A _Zak Seidov_, Aug 07 2010

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)