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 A264973 #10 Dec 06 2015 21:11:03 %S A264973 262,338,850,1058,1238,1838,1786,734,1622,1594,710,554,818,1118,1574, %T A264973 2014,1834,1306,742,1922,1270,838,1018,718,334,290,802,622,322,494, %U A264973 650,478,266,946,550,274,458,922,766,790,1778,1054,826,1418,1358,1982,1606,1954,614,674,794,1478,1702,986,1526,1870,1714,1090,598,298,386,970,1370 %N A264973 Trajectory of 262 under permutation A264966: a(0) = 262; for n >= 1, a(n) = A264966(a(n-1)). %C A264973 The trajectory is probably infinite, not periodic. %H A264973 Antti Karttunen, <a href="/A264973/b264973.txt">Table of n, a(n) for n = 0..1000</a> %F A264973 a(0) = 262; for n >= 1, a(n) = A264966(a(n-1)). %e A264973 a(0) = 262 by definition. Its base-3 representation is A007089(262) = 100201. Reversing the significant prefix (in this case the whole expansion because no trailing zeros present), we get 102001 (= A007089(298)). Base-2 representation of 298 is 100101010 (= A007088(298)). Reversing its significant prefix, we get 101010010 (= A007088(338)), thus a(1) = 338. %o A264973 (Scheme, with memoizing macro definec) %o A264973 (definec (A264973 n) (if (zero? n) 262 (A264966 (A264973 (- n 1))))) %Y A264973 Cf. A007088, A007089, A264966, A264969, A264972. %K A264973 nonn,base %O A264973 0,1 %A A264973 _Antti Karttunen_, Dec 06 2015