cp's OEIS Frontend

A385512 a(n) is the least prime p > n in which the digits of n appear as an ordered but not necessarily contiguous subsequence.

%I A385512 #23 Jul 06 2025 17:22:27
%S A385512 101,11,23,13,41,53,61,17,83,19,101,101,127,103,149,151,163,107,181,
%T A385512 109,1201,211,223,223,241,251,263,127,281,229,307,131,1321,233,347,
%U A385512 353,367,137,383,139,401,241,421,431,443,457,461,347,487,149,503,151,521,353,541
%N A385512 a(n) is the least prime p > n in which the digits of n appear as an ordered but not necessarily contiguous subsequence.
%H A385512 Michael S. Branicky, <a href="/A385512/b385512.txt">Table of n, a(n) for n = 0..10000</a>
%e A385512 a(11) = 101, because 101 is the least prime p > 11 in which the digits of 11 appear as an ordered but non-necessarily contiguous subsequence.
%o A385512 (Python)
%o A385512 from sympy import sieve
%o A385512 def osub(n, t): # n > 0 is an ordered_subsequence of t
%o A385512     if t < n: return False
%o A385512     while n and t:
%o A385512         if n%10 == t%10:
%o A385512             n //= 10
%o A385512         t //= 10
%o A385512     return n == 0
%o A385512 def a(n): return next(p for p in sieve if p > n and osub(n, p)) if n else 101
%o A385512 print([a(n) for n in range(55)]) # _Michael S. Branicky_, Jul 01 2025
%Y A385512 Cf. A000040, A068164, A381606.
%K A385512 nonn,base
%O A385512 0,1
%A A385512 _Jean-Marc Rebert_, Jul 01 2025