This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A294267 Largest k such that there exists a decimal string of length n containing each of the first k primes as a subsequence. 1
 1, 2, 3, 4, 4, 7, 12, 17, 20, 22, 25, 29, 46, 58, 63, 85 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Carlos Rivera, Puzzle 896: Optimal packing of a set of integers EXAMPLE For n=1, "2" contains the first 1 prime as a subsequence, so a(1)=1. For n=2, "23" contains each of the first 2 primes as a subsequence, so a(2)=2. For n=3, "235" contains each of the first 3 primes as a subsequence, so a(3)=3. For n=4, "2357" contains each of the first 4 primes as a subsequence, so a(4)=4. For n=5, we cannot add any new primes as the 5th prime (11) requires two extra digits, so a(5)=a(4)=4. For n=6, "112357" contains each of the first 7 primes (2 to 17) as a subsequence, so a(6)=7. For n=7, "1231579" contains each of the first 12 primes (2 to 37) as a subsequence, so a(7)=12. CROSSREFS Smallest strings are in A294268. Sequence in context: A006087 A241315 A136330 * A301763 A236129 A240219 Adjacent sequences:  A294264 A294265 A294266 * A294268 A294269 A294270 KEYWORD nonn,base,more AUTHOR Dmitry Kamenetsky, Feb 11 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 19 12:57 EST 2018. Contains 317351 sequences. (Running on oeis4.)