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.

A134649 Minimal n-primeval numbers: a(n) = smallest number M such that all primes with <= n digits are embedded in a permuted subsequence of M's digits.

This page as a plain text file.
%I A134649 #7 Aug 22 2025 06:28:19
%S A134649 2357,1123456789,1012233445566778899,10011222333444555666777888999,
%T A134649 1000111222233334444555666777788889999,
%U A134649 100001111222233333444445555566666777778888899999,100000111112222233333344444555556666677777788888999999
%N A134649 Minimal n-primeval numbers: a(n) = smallest number M such that all primes with <= n digits are embedded in a permuted subsequence of M's digits.
%H A134649 M. Keith, <a href="http://www.cadaeic.net/primeval.htm">Integers containing many embedded primes</a>
%Y A134649 Cf. A039993, A135377.
%K A134649 nonn,base,easy,changed
%O A134649 1,1
%A A134649 _N. J. A. Sloane_, Jan 25 2008
%E A134649 Extended by _Charles R Greathouse IV_, Aug 13 2009