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 A255851 #12 Aug 21 2016 14:07:17 %S A255851 1,1,0,1,1,0,1,0,0,0,1,1,0,0,0,0,0,1,0,3,1,0,0,0,0,0,0,0,0,8,0,3,0,0, %T A255851 0,0,0,0,0,1,0,9,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,34,0,0,0,1,0,1,0,0, %U A255851 0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0 %N A255851 Number of n-digit squares which remain squares if every digit is decreased by 1 (cf. A061844). %C A255851 Counts the occurrences of n in A255850. %H A255851 Lars Blomberg, <a href="/A255851/b255851.txt">Table of n, a(n) for n = 1..180</a> %o A255851 (PARI) a(n,A=A255850)=sum(i=1,#A,A[i]==n) %Y A255851 Cf. A255850, A061844, A055642. %K A255851 nonn,base %O A255851 1,20 %A A255851 _M. F. Hasler_, Mar 10 2015 %E A255851 Corrected a(30) and more terms calculated from A061844 by _Lars Blomberg_, Aug 21 2016