This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A112435 #7 Jun 22 2019 15:19:19 %S A112435 0,0,0,0,0,0,0,0,0,4,4,8,16,23,28,38,45,42,41,41,36,34,32,31,30,28,29, %T A112435 33,34,37,44,42,37,41,39,41,38,43,40,39,39,46,45,47,54,51,45,44,43,39, %U A112435 42,42,39,43,43,38,43,44,40,37,40,33,32,29,36,35,39,45,49,51,48,52,47 %N A112435 Next term is the sum of the last 10 digits in the sequence, beginning with a(10) = 4. %C A112435 Variation on Angelini's A112395. The sequence cycles at a(16)=38 and the loop has 312 terms. It is exactly the same loop as in A112433 "Next term is the sum of the last 10 digits in the sequence, beginning with a(10) = 2" and the first term of this 4-loop is the first term of that 2-loop . Computed by Gilles Sadowski. %H A112435 Harvey P. Dale, <a href="/A112435/b112435.txt">Table of n, a(n) for n = 1..1000</a> %e A112435 a(16)=38 because 4 + 4 + 8 + 1+6 +2+3 + 2+8 = 38 %t A112435 nxt[{t_,a_}]:={Take[Join[t,IntegerDigits[Total[t]]],-10],Total[t]}; Join[ {0,0,0,0,0,0,0,0,0},NestList[nxt,{{0,0,0,0,0,0,0,0,0,4},4},80][[All,2]]] (* _Harvey P. Dale_, Jun 22 2019 *) %Y A112435 Cf. A112395, A004207, A065075, A001370. %K A112435 base,easy,nonn %O A112435 1,10 %A A112435 _Alexandre Wajnberg_, Dec 11 2005