Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 May 23 2013 15:49:56
%S 4,10,25,64,154,363,820,1811,3873,8161,16682,33757,66865,130938,
%T 251983,480794,903982,1685564,3106009,5677864,10276936,18464659,
%U 32891188,58169965,102136773,178096365,308593320,531191385,909227947,1546356486,2617639293
%N 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 Numbers (other than 0) that end in zero are excluded.
%H David Radcliffe, <a href="/A225301/a225301.py.txt">Python code for calculating a(n).</a>
%F Equals one more than the partial sums of A098701.
%e For n = 2 the a(2) = 10 solutions are 0, 1, 2, 3, 11, 12, 13, 21, 22, 31.
%Y Cf. A085305, A061909.
%K nonn,base
%O 1,1
%A _David Radcliffe_, May 05 2013