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 A088180 #16 Sep 04 2014 17:22:13 %S A088180 1,5,19,112,368,2161,7033,41140,133730,781884,2541197,14856466, %T A088180 48283738,282274893,917394087,5363229225,17430497086,101901374524, %U A088180 331179473681,1936126175213,6292410089388,36786397511512,119555791973835,698941553280624,2271560048351176 %N A088180 a(n) is the number of numbers m < 10^n for which there is at least one k such that k + reverse(k) = m. %C A088180 Number of terms of A067030 below 10^n. %C A088180 a(16)-a(18) are based on two empirically detected recursive formulas. [_Lars Blomberg_, Nov 25 2011] %H A088180 Hiroaki Yamanouchi, <a href="/A088180/b088180.txt">Table of n, a(n) for n = 0..100</a> %H A088180 Lars Blomberg, <a href="/A088180/a088180.pdf">A short investigation of the sequence and derivation of the recursive formulas</a> %H A088180 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a> %e A088180 a(1) = 5 since 0, 2, 4, 6, 8 are the terms of A067030 which are smaller than 10^1. %Y A088180 Cf. A067030. %K A088180 nonn,base %O A088180 0,2 %A A088180 _Klaus Brockhaus_, Sep 22 2003 %E A088180 a(9)-a(10) from _Donovan Johnson_, Sep 22 2009 %E A088180 a(11)-a(18) from _Lars Blomberg_, Dec 19 2011 %E A088180 a(19)-a(24) from _Hiroaki Yamanouchi_, Sep 04 2014