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.
%I A178928 #8 Mar 30 2012 18:40:57
%S A178928 10,121,123,1234,123451,1234561,1234567,123456782,12345678911,
%T A178928 123456789101,123456789101117,12345678910111229,123456789101112133,
%U A178928 123456789101112131414,1234567891011121314159
%N A178928 Smallest semiprime containing leading sequence of n ascending numbers.
%C A178928 This is to semiprimes A001358 as A053546 is to primes A000040.
%e A178928 a(1) = 10 because 10 = 2 * 5 is the smallest semiprime (or biprime, products of two primes) whose leftmost (base 10) digit is 1.
%e A178928 a(2) = 121 because 121 = 11^2 semiprime whose leftmost digits are 12.
%e A178928 a(3) = 123 since it is a semiprime already.
%e A178928 a(4) = 1234 = 2 * 617.
%e A178928 a(5) = 123451 = 41 * 3011.
%e A178928 a(6) = 1234561 = 211 * 5851.
%t A178928 semiPrimeQ[n_] := Plus @@ Last /@ FactorInteger@ n == 2; f[n_] := Block[{k = 0, m = FromDigits@ Flatten@ IntegerDigits@ Range@ n}, If[ semiPrimeQ@ m, , While[a = 10^(1 + Max[0, Floor@ Log10@ k]) m + k; ! semiPrimeQ@ a, k++]; m = a]; m]; Array[f, 15]
%Y A178928 Cf. A001358, A053546, A100959.
%K A178928 nonn,easy
%O A178928 1,1
%A A178928 _Jonathan Vos Post_, Dec 30 2010