cp's OEIS Frontend

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.

A065112 Smallest prime whose decimal expansion ends (nontrivially) with the n-th prime; or 0 if no such prime exists.

This page as a plain text file.
%I A065112 #29 Jan 10 2025 11:56:23
%S A065112 0,13,0,17,211,113,317,419,223,229,131,137,241,443,347,353,359,461,
%T A065112 167,271,173,179,283,389,197,5101,1103,5107,1109,2113,4127,2131,2137,
%U A065112 4139,11149,1151,4157,1163,3167,6173,2179,1181,3191,1193,5197,6199,4211
%N A065112 Smallest prime whose decimal expansion ends (nontrivially) with the n-th prime; or 0 if no such prime exists.
%C A065112 a(1) and a(3) (respectively for primes 2 and 5) are trivially zero. All other terms are nonzero by Dirichlet's theorem on arithmetic progressions. - _Joerg Arndt_, Jun 06 2021
%H A065112 Daniel Mondot, <a href="/A065112/b065112.txt">Table of n, a(n) for n = 1..10000</a>
%H A065112 Wikipedia, <a href="https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions">Dirichlet's theorem on arithmetic progressions</a>
%t A065112 f[n_] := (k = 1; While[a = ToExpression[ ToString[k] <> ToString[n]]; ! PrimeQ[a], k++ ]; a); Table[ f[ Prime[n]], {n, 4, 50} ]
%Y A065112 Cf. A030670.
%K A065112 nonn,base
%O A065112 1,2
%A A065112 _Robert G. Wilson v_, Nov 12 2001