cp's OEIS Frontend

A033936 a(n+1) = a(n) + sum of squares of digits of a(n).

%I A033936 #14 Aug 23 2022 14:47:58
%S A033936 1,2,6,42,62,102,107,157,232,249,350,384,473,547,637,731,790,920,1005,
%T A033936 1031,1042,1063,1109,1192,1279,1414,1448,1545,1612,1654,1732,1795,
%U A033936 1951,2059,2169,2291,2381,2459,2585,2703,2765,2879,3077,3184
%N A033936 a(n+1) = a(n) + sum of squares of digits of a(n).
%C A033936 Orbit of 1 under iterations of A258881. - _M. F. Hasler_, Jul 23 2015
%H A033936 Robert Israel, <a href="/A033936/b033936.txt">Table of n, a(n) for n = 0..10000</a>
%F A033936 a(n+1) = A258881(a(n)). a(n) = (A258881^n)(1). - _M. F. Hasler_, Jul 23 2015
%e A033936 After 1063, since 1^2 + 0^2 + 6^2 + 3^2 = 46 we get 1063+46 = 1109.
%p A033936 A[0] := 1;
%p A033936 for n to 50 do
%p A033936    A[n] := A[n-1]+add(t^2, t = convert(A[n-1], base, 10))
%p A033936 od:
%p A033936 seq(A[i],i=0..50); # _Robert Israel_, Feb 15 2018
%t A033936 NestList[#+Total[IntegerDigits[#]^2]&,1,45] (* _Harvey P. Dale_, Aug 14 2011 *)
%Y A033936 Cf. A258881, A003132, A076161.
%K A033936 nonn,base
%O A033936 0,2
%A A033936 Olivier Gorin (gorin(AT)roazhon.inra.fr)