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 A238856 #9 Dec 21 2015 03:34:29 %S A238856 0,3,3,4,3,4,5,4,4,6,4,6,6,6,6,5,4,7,6,7,5,6,5,8,6,6,6,6,7,7,6,6,8,6, %T A238856 8,7,8,8,7,8,7,8,8,8,8,7,7,9,9,8,7,8,10,10,9,8,6,9,8,7,9,9,9,9,11,8,7, %U A238856 9,10,9,10,9,9,11,10,10,9,9,8,9,9,8,10,10,10,9,9,9,10,11 %N A238856 Number of digits of the largest right-truncatable reversible prime in base n. %C A238856 For definitions and more comments, see A238854 and A238850. A weak conjecture: this sequence might be bounded. %H A238856 Stanislav Sykora, <a href="/A238856/b238856.txt">Table of n, a(n) for n = 2..390</a> %H A238856 Stanislav Sykora, <a href="https://oeis.org/wiki/File:GeneticThreads.txt">PARI/GP scripts for genetic threads</a>, with code and comments. %e A238856 a(16) = 6 because the largest truncatable reversible prime in base 16 has 6 hexadecimal digits (see A238851). %o A238856 (PARI) See the link. %Y A238856 Cf. Full in base 10: A238850, 16: A238851, 100: A238852, 256: A238853. %Y A238856 Cf. In base n: A238854 (largest), A238855 (totals), A238857 (m-digit counts). %Y A238856 Cf. A007500, A023107, A024770, A237600, A237601, A237602. %K A238856 nonn,base,hard %O A238856 2,2 %A A238856 _Stanislav Sykora_, Mar 13 2014