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 A238855 #16 Dec 21 2015 14:11:47 %S A238855 0,3,4,12,5,12,24,17,16,33,22,29,50,39,40,39,24,65,80,100,58,58,69, %T A238855 122,101,90,83,125,114,133,114,122,255,203,252,123,152,221,202,308, %U A238855 131,250,299,397,303,143,201,484,497,423,269,253,442,944,845,378,231,460,420,455,538,438 %N A238855 Number of all right-truncatable reversible primes in base n. %C A238855 For definitions and more comments, see A238854 and A238850. %C A238855 Conjecture: in any base n, the number of right-truncatable reversible primes is finite. %H A238855 Stanislav Sykora, <a href="/A238855/b238855.txt">Table of n, a(n) for n = 2..390</a> %H A238855 Stanislav Sykora, <a href="https://oeis.org/wiki/File:GeneticThreads.txt">PARI/GP scripts for genetic threads</a>, with code and comments %e A238855 In bases 10, 16, 100, and 256 (used as examples in the crossrefs) there are, respectively, 16, 40, 1552, and 35127 such numbers. %o A238855 (PARI) See the link. %Y A238855 Cf. Full in base 10: A238850, 16: A238851, 100: A238852, 256: A238853. %Y A238855 Cf. In base n: A238854 (largest), A238856 (maximum digits), A238857 (m-digit counts). %Y A238855 Cf. A007500, A023107, A024770, A237600, A237601, A237602. %K A238855 nonn,base %O A238855 2,2 %A A238855 _Stanislav Sykora_, Mar 07 2014