A prime is deletable in base b if its base-b digits can be removed one at a time, never creating a leading zero, so that every intermediate number is prime, ending at a single-digit prime. We carry out a systematic computation of the counts of n-digit base-b deletable primes for 3 = 5. Finally we record several new integer sequences. All code and verification records are public.
Daniel Okwor (Tue,) studied this question.