%I #36 Aug 06 2017 10:20:49
%S 6,36,9,81,117,162,38,13,2,4,16,17,26,8,64,41,34,104,128,164,66,61,26,
%T 8,64,41,34,104,128,164,66,61,26,8,64,41,34,104,128,164,66,61,26,8,64,
%U 41,34,104,128,164,66,61,26,8,64,41,34,104,128,164,66,61,26,8,64,41
%N The "sum of squares of digits" problem in base 12, start with 6 (written in base 10).
%C Periodic with period 10.
%C In base 12, there are 3 fixed points and 4 cycles (only 1 fixed point and 1 cycle in base 10, see A161772):
%C 1 -> 1 (length 1);
%C 5 -> 21 -> 5 (length 2);
%C 8 -> 54 -> 35 -> 2a -> 88 -> a8 -> 118 -> 56 -> 51 -> 22 -> 8 (length 10);
%C 18 -> 55 -> 42 -> 18 (length 3);
%C 25 -> 25 (length 1);
%C 68 -> 84 -> 68 (length 2);
%C a5 -> a5 (length 1);
%C Notice 25 (decimal 29) and a5 (decimal 125) are Armstrong numbers in base 12 (A161949), there are no 2-digit Armstrong numbers in base 10.
%C In base 12, there are only few happy numbers (no such between 10 (decimal 12) and 100 (decimal 144)), but in base 10, there are 20 happy numbers less than or equal to 100 (see A007770).
%H Eric Chen, <a href="/A250202/b250202.txt">Table of n, a(n) for n = 1..1000</a>
%H Eric Chen, <a href="/A250202/a250202.txt">List of A250202 starts with n for n up to 40 (decimal 48)</a>
%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%t NestList[Total[IntegerDigits[#, 12]^2]&, 6, 144]
%t Join[{6, 36, 9, 81, 117, 162, 38, 13, 2, 4, 16, 17},LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 0, 1},{26, 8, 64, 41, 34, 104, 128, 164, 66, 61},54]] (* _Ray Chandler_, Aug 26 2015 *)
%t PadRight[{6,36,9,81,117,162,38,13,2,4,16,17},80,{66,61,26,8,64,41,34,104,128,164}] (* _Harvey P. Dale_, Aug 06 2017 *)
%o (PARI) a(n) = [6, 36, 9, 81, 117, 162, 38, 13, 2, 4, 16, 17, 26, 8, 64, 41, 34, 104, 128, 164, 66, 61][n%10+10*(n>=10)+10*(n%10<3 & n>=20)]
%Y Cf. A000216, A000218, A080709, A000221, A008460, A008461, A008462, A008463, A161772.
%K nonn,easy,base
%O 1,1
%A _Eric Chen_, Mar 13 2015