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!)
A098751 a(n+1) = a(n) + 10's complement of each of the digits of a(n); a(0) = 0. 1

%I #8 Jan 02 2014 19:55:02

%S 0,10,29,38,47,56,65,74,83,92,101,129,147,165,183,201,228,246,264,282,

%T 300,327,345,363,381,399,408,426,444,462,480,498,507,525,543,561,579,

%U 588,597,606,624,642,660,678,687,696,705,723,741,759,768,777,786,795

%N a(n+1) = a(n) + 10's complement of each of the digits of a(n); a(0) = 0.

%C 0 -> 10 because 0 + (10 - 0) = 10; 10 -> 29 because 10 + [(10 - 1) + (10 - 0)] = 29; 29 -> 38 because 19 + [(10 - 1) + (10 - 9)] = 38; ...

%H Harvey P. Dale, <a href="/A098751/b098751.txt">Table of n, a(n) for n = 0..1000</a>

%t NestList[Total[10-IntegerDigits[#]]+#&,0,60] (* _Harvey P. Dale_, Jan 02 2014 *)

%Y Cf. A004207, A098750.

%K base,easy,nonn

%O 0,2

%A _Eric Angelini_, Oct 01 2004

%E More terms from _Sam Alexander_, Jan 06 2005

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 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)