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 A341717 #17 Feb 22 2021 21:14:36
%S A341717 2,3,7,5,7,7,9,187
%N A341717 a(n) = smallest m >= n such that the decimal concatenation n||n+1||n+2||...||m is prime, or -1 if no such prime exists.
%C A341717 These are the values of n+k from A341715. See that entry for more information.
%C A341717 See A084559 (the same for nonprime indices) for further information. - _M. F. Hasler_, Feb 22 2021
%C A341717 Suppose n > 3. If n == 2 (mod 3), then a(n) == 3 or 5 (mod 6). If n = 0 or 1 (mod 3), then a(n) == 1 (mod 6) (see A341716). - _Chai Wah Wu_, Feb 22 2021
%F A341717 a(n) = n iff n is prime, otherwise a(n) = A084559(n). - _M. F. Hasler_, Feb 22 2021
%t A341717 Array[Block[{k = #, s = #}, While[! PrimeQ[s], k++; s = FromDigits[IntegerDigits[s]~Join~IntegerDigits[k]]]; k] &, 8, 2] (* _Michael De Vlieger_, Feb 22 2021 *)
%o A341717 (PARI) A341717(n)=if(isprime(n), n, A084559(n)) \\ _M. F. Hasler_, Feb 22 2021
%Y A341717 Cf. A084559, A140793, A341715, A341716.
%K A341717 nonn,base,more
%O A341717 2,1
%A A341717 _N. J. A. Sloane_, Feb 22 2021