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 A209914 #7 Mar 30 2012 17:23:05
%S A209914 0,0,1,1,0,1,0,1,0,0,8,1,0,0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,0,0,2,1,0,0,
%T A209914 0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,2,0,2,1,0,0,0,0,0,0,0,4,0,0,0,1,0,0,
%U A209914 0,0,2,3,0,0,1,0,0,0,0,0,0,0,1,2
%N A209914 Number of ways n can be written as a multiple of its reversal A004086(n) +/- a prime p < n.
%C A209914 If n is not a multiple of 10, then a(n) < 20. The subsequence { a(10k) }, however, is unbounded. In particular, a(10^k)=2*A006880(k).
%e A209914 a(10)=8 because R(10)=01=1 and 10 = 3*1 + 7 = 5*1 + 5 = 7*1 + 3 = 8*1 + 2 = 12*1 - 2 = 13*1 - 3 = 15*1 - 5 = 17*1 - 7.
%o A209914 (PARI) a(n)={my(r=A004086(n)); sum(k=1, (2*n-1)\(r+!r), isprime(abs(n-k*r)))}
%Y A209914 Cf. A209063.
%K A209914 nonn,base
%O A209914 0,11
%A A209914 _M. F. Hasler_, Mar 15 2012