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!)
A247107 a(0) = 0, a(n) = previous term + repunit of length of previous term for n > 0. 1

%I #77 Dec 07 2019 15:06:42

%S 0,1,2,3,4,5,6,7,8,9,10,21,32,43,54,65,76,87,98,109,220,331,442,553,

%T 664,775,886,997,1108,2219,3330,4441,5552,6663,7774,8885,9996,11107,

%U 22218,33329,44440,55551,66662,77773,88884,99995,111106,222217,333328,444439

%N a(0) = 0, a(n) = previous term + repunit of length of previous term for n > 0.

%H Alois P. Heinz, <a href="/A247107/b247107.txt">Table of n, a(n) for n = 0..1000</a>

%F a(0) = 0, a(n) = a(n-1) + A002275(A055642(a(n-1))) for n>0.

%F From _Jon E. Schoenfield_, Nov 30 2014: (Start)

%F For n > 1, a(n) = a(n-1) + (10^(floor(log_10(a(n-1))) + 1) - 1) / 9.

%F For n > 0, a(n) = ((n-1) mod 9 + 1) * (10^D - 1) / 9 + 1 - D, where D = floor((n-1)/9) + 1. (There are exactly D digits in a(n).) (End)

%F G.f.: -(10*x^10-10*x^9+1)*x/((10*x^9-1)*(x-1)^2). - _Alois P. Heinz_, Nov 30 2014

%e 98 = 9*10 + 8 -> 10*10 + 9 = 109.

%e 109 = 1*100 + 0*10 + 9*1 -> 2*100 + 1*10 + 10*1 = 220.

%e a(42) = 44440 + (10^(floor(log_10(44440))+1)-1) / 9 = 44440 + (10^(4+1)-1) / 9 = 44440 + 99999/9 = 44440 + 11111 = 55551.

%Y Similar to A158699, but with simpler rules.

%Y Cf. A002275, A055642.

%K nonn,base,easy

%O 0,3

%A _Dhilan Lahoti_, Nov 30 2014

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