%I #59 Feb 19 2024 10:28:43
%S 0,1,12,123,1234,12345,123456,1234567,12345678,123456789,1234567890,
%T 12345678901,123456789012,1234567890123,12345678901234,
%U 123456789012345,1234567890123456,12345678901234567,123456789012345678
%N Concatenate next digit at right hand end (where the next digit after 9 is again 0).
%C Also called the triangle of the gods (see Pickover link).
%C See A037610 for a general formula. - _Hieronymus Fischer_, Jan 03 2013
%D Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 61.
%H T. D. Noe and Hieronymus Fischer, <a href="/A057137/b057137.txt">Table of n, a(n) for n = 0..200</a> (terms up to 100 from T. D. Noe)
%H Clifford Pickover, <a href="http://sprott.physics.wisc.edu/Pickover/trianglegod.htm">Triangle of the Gods</a>
%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (10,0,0,0,0,0,0,0,0,1,-10).
%F a(n) = 10*(a(n-1)-floor[n/10]) + n = floor[A057139(n)/10^(n-1)].
%F a(n) = floor((137174210/1111111111)*10^n). - _Hieronymus Fischer_, Jan 03 2013, corrected by _M. F. Hasler_, Jan 13 2013
%p A057137:=n->floor((137174210/1111111111)*10^n); seq(A057137(n), n=0..20); # _Wesley Ivan Hurt_, Apr 18 2014
%t a[n_]:=Floor[137174210/1111111111*10^n]; Array[a,19,0] (* _Robert G. Wilson v_, Apr 18 2014 *)
%o (PARI) A057137(n)=sum(i=1,n,i%10*10^(n-i)) \\ _M. F. Hasler_, Jan 13 2013
%o (PARI) A057137(n)=137174210*10^n\1111111111 \\ _M. F. Hasler_, Jan 13 2013
%Y Alternative progression for n >= 10 compared with A007908 and A014824.
%Y Cf. A057138 for reverse. Cf. A010879 (decimal digits).
%Y For primes see A120819.
%K base,easy,nonn
%O 0,3
%A _Henry Bottomley_, Aug 12 2000