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 A277110 #38 Feb 10 2017 20:12:39 %S A277110 0,1,1,4,25,841,866,1707,2573,214,2787,9006001,6898,1099,7997,758,515, %T A277110 1273,298,2468041,2468339,5674,2474013,13853,2487866,5357,2493223, %U A277110 1322,498909,250231053361,7149472922,203937,420569227,1581854,9201,1591055,94,13371,13465,13418,309,371,34,15,49,4,2809 %N A277110 a(n) = A066048(a(n-1) + a(n-2)) with a(0) = 0 and a(1) = 1. %C A277110 The sequence enters a cycle after 1440 terms. %C A277110 7833343487493084437^2 is the largest term of this sequence. %H A277110 Altug Alkan, <a href="/A277110/b277110.txt">Table of n, a(n) for n = 0..2000</a> %F A277110 a(n) = a(n+480) for n > 1440. %e A277110 a(4) = 25 because A066048(1 + 4) = A066048(5) = 25. %Y A277110 Cf. A000045, A066048, A175723. %K A277110 nonn %O A277110 0,4 %A A277110 _Altug Alkan_, Feb 09 2017