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!)
A332701 Lexicographically earliest sequence of distinct positive terms such that the digitsum of a(n) is the length of a(n+1). 1

%I #15 Feb 22 2020 10:54:35

%S 1,2,10,3,100,4,1000,5,10000,6,100000,7,1000000,8,10000000,9,

%T 100000001,11,12,101,13,1001,14,10001,15,100001,16,1000001,17,

%U 10000001,18,100000002,102,103,1002,104,10002,105,100002,106,1000002,107,10000002,108,100000003

%N Lexicographically earliest sequence of distinct positive terms such that the digitsum of a(n) is the length of a(n+1).

%C The digitsum (sometimes called digsum) of an integer is the sum of its digits. The digitsum of 54321 is 5+4+3+2+1 = 15 (see A007953).

%C Among the first 10000 terms the largest value is 10000000000000000000000003. For 100000 terms it is 1000000000000000000000000000000004. - _Lars Blomberg_, Feb 22 2020

%H Lars Blomberg, <a href="/A332701/b332701.txt">Table of n, a(n) for n = 1..10000</a>

%e a(1) = 1 with digitsum 1 and a(2) = 2 has 1 digit;

%e a(2) = 2 with digitsum 2 and a(3) = 10 has 2 digits;

%e a(3) = 10 with digitsum 1 and a(4) = 3 has 1 digit;

%e a(4) = 3 with digitsum 3 and a(5) = 100 has 3 digits;

%e a(5) = 100 with digitsum 1 and a(6) = 4 has 1 digits;

%e a(6) = 4 with digitsum 4 and a(7) = 1000 has 4 digits; etc.

%Y A007953 (Digital sum (i.e., sum of digits) of n; also called digsum(n)).

%K base,nonn

%O 1,2

%A _Eric Angelini_ and _Lars Blomberg_, Feb 20 2020

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 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)