A294268 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A294268

Smallest n-digit decimal string that contains each of the first A294267(n) primes as a subsequence.

2, 23, 235, 2357, 12357, 112357, 1231579, 12453179, 124536719, 1234567139, 12456783197, 102456783197, 1023456897139, 21023456897139, 212304567891379, 2314023567891379

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Table of n, a(n) for n=1..16.

Carlos Rivera, Puzzle 896: Optimal packing of a set of integers

CROSSREFS

Cf. A294267.

Sequence in context: A283560 A159902 A301339 * A118385 A098739 A287353

Adjacent sequences: A294265 A294266 A294267 * A294269 A294270 A294271

KEYWORD

nonn,base,more

AUTHOR

Dmitry Kamenetsky, Feb 11 2018

STATUS

approved