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 A225301 #9 May 23 2013 15:49:56 %S A225301 4,10,25,64,154,363,820,1811,3873,8161,16682,33757,66865,130938, %T A225301 251983,480794,903982,1685564,3106009,5677864,10276936,18464659, %U A225301 32891188,58169965,102136773,178096365,308593320,531191385,909227947,1546356486,2617639293 %N A225301 Number of solutions to rev(x^2) = rev(x)^2 with at most n digits, where the function rev(x) reverses the digits of x. %C A225301 Numbers (other than 0) that end in zero are excluded. %H A225301 David Radcliffe, <a href="/A225301/a225301.py.txt">Python code for calculating a(n).</a> %F A225301 Equals one more than the partial sums of A098701. %e A225301 For n = 2 the a(2) = 10 solutions are 0, 1, 2, 3, 11, 12, 13, 21, 22, 31. %Y A225301 Cf. A085305, A061909. %K A225301 nonn,base %O A225301 1,1 %A A225301 _David Radcliffe_, May 05 2013