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 A214882 #9 Aug 01 2012 20:38:25 %S A214882 1,1,5,1,29,57,37,33,109,841,373,3761,8125,9817,8517,41025,73741, %T A214882 67177,118293,967377,822621,3100537,6492133,16397921,33478573, %U A214882 13406601,83211957,177703665,35540733,114482329,881889925,176377985,35275597,15468937385,3093787477 %N A214882 A007185(n)/5^n. %C A214882 Conjecture: For any odd m and for any k, the density of n such that a(n) == k (mod m) is 1/m. %H A214882 Eric M. Schmidt, <a href="/A214882/b214882.txt">Table of n, a(n) for n = 1..3000</a> %H A214882 <a href="/index/Ar#automorphic">Index entries for sequences related to automorphic numbers</a> %o A214882 (GAP) A214882 := function(max) local result, i; result := [5]; for i in [2..max] do Add(result, result[i-1]^2 mod 10^i); od; result := List([1..max], n->result[n]/5^n); return result; end; %Y A214882 Cf. A214880, A214881, A214883. %K A214882 nonn,base %O A214882 1,3 %A A214882 _Eric M. Schmidt_, Jul 31 2012