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 A209063 #21 Jan 27 2021 10:35:37 %S A209063 1,2,0,1,4,3,0,2,1,1,1,1,1,1,0,0,3,2,4,0,0,2,0,2,1,3,1,1,1,1,1,4,1,4, %T A209063 2,0,1,2,1,1,1,2,1,0,1,1,1,4,4,1,0,1,1,2,0,3,2,0,0,3,1,3,0,0,1,3,0,0, %U A209063 2,1,0,1,0,0,1,1,0,1,1,0,0,0,0,0,1,0,1,1,1,1,0,1,1,1,0,0,1,1,0,1,1,1 %N A209063 Let p = A099180(n) be the n-th prime which is greater than its reversal p'; a(n) = number of ways to write p as a multiple of p' +- q where q is a prime < p. %C A209063 Sequence is bounded - see A202286. %F A209063 Equals A209914 o A099180. - _M. F. Hasler_, Mar 15 2012 %e A209063 For n=6, p = 71, p' = 17 and there are three solutions: %e A209063 71 = 2*17 + 3771 = 4*17 + 371 = 6*17 - 31, so a(6) = 3. %o A209063 (PARI) A209063(n)=A209914(A099180(n)) \\ _M. F. Hasler_, Mar 15 2012 %Y A209063 Cf. A099180, A209914. A202286 gives smallest m such that a(m) = n. %K A209063 nonn,base %O A209063 1,2 %A A209063 _N. J. A. Sloane_, Mar 13 2012