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 A090862 #11 Mar 28 2025 04:29:50
%S A090862 11,11,11,11,11,12,11,11,11,12,11,11,11,14,13,11,11,11,11,12,11,11,11,
%T A090862 11,11,11,11,11,11,12,11,11,11,11,11,11,11,11,11,12,12,12,11,11,12,11,
%U A090862 11,11,11,11,11,12,12,11,11,12,11,11,11,11,11,11,12,11,11,11,12,11,11
%N A090862 Smallest b > 10 such that the decimal representation of the n-th prime is not a prime in base b representation.
%H A090862 Amiram Eldar, <a href="/A090862/b090862.txt">Table of n, a(n) for n = 5..10000</a>
%F A090862 a(A091922(n)) = n and a(m) <> n for m < A091922(n).
%e A090862 For n = 10: A000040(10) = 29 in base 11 2*11^1 + 9*11^0 = 31 is prime, 29 in base 12 is 2*12^1 + 9*12^0 = 33 = 3*11 is not prime, therefore a(10) = 12.
%t A090862 a[n_] := Module[{d = IntegerDigits[Prime[n]], b = 11}, While[PrimeQ[FromDigits[d, b]], b++]; b]; Array[a, 100, 5] (* _Amiram Eldar_, Mar 28 2025 *)
%Y A090862 Cf. A091922, A091923, A091924.
%K A090862 nonn,base
%O A090862 5,1
%A A090862 _Reinhard Zumkeller_, Feb 12 2004