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 A048992 #43 Jul 01 2021 07:11:01 %S A048992 12,23,31,34,41,42,45,51,52,53,56,61,62,63,64,67,71,72,73,74,75,78,81, %T A048992 82,83,84,85,86,89,91,92,93,94,95,96,97,98,101,111,113,121,122,123, %U A048992 131,141,151,161,171,181,191,192,201,202,210,211,212,213,214,215,216,217 %N A048992 Hannah Rollman's numbers: the numbers excluded from A048991. %C A048992 A105390(n) = number of terms <= n; for n < 740: A105390(n) < n/2. - _Reinhard Zumkeller_, Apr 04 2005 %C A048992 A116700 is a similar sequence. Note that 21 is missing from the current sequence, because we deleted 12 in computing A048991 and now 21 is no longer "earlier in the sequence". On the other hand 21 is present in A116700. - _N. J. A. Sloane_, Aug 05 2007 %C A048992 Otherwise said: Numbers which occur in the concatenation of all smaller numbers not listed in this sequence. - _M. F. Hasler_, Dec 29 2012 %C A048992 Number of terms < 10^n, n = 1, 2, ...: (0, 37, 589, 7046, ...), gives number of n-digit terms as first differences: (37, 552, 6457, ...). - _M. F. Hasler_, Oct 25 2019 %H A048992 T. D. Noe, <a href="/A048992/b048992.txt">Table of n, a(n) for n = 1..10000</a> %H A048992 Nick Hobson, <a href="/A048992/a048992.py.txt">Python program for this sequence</a> %t A048992 a[0] = 1; s = "1"; a[n_] := a[n] = For[k = a[n-1] + 1, True, k++, If[StringFreeQ[s, t = ToString[k]], s = s <> t, Return[k]]]; Table[a[n], {n, 1, 100}] (* _Jean-François Alcover_, Nov 25 2013 *) %o A048992 (Python) # see Hobson link %o A048992 (Haskell) %o A048992 import Data.List (isInfixOf) %o A048992 a048992 n = a048992_list !! (n-1) %o A048992 a048992_list = g [1..] [] where %o A048992 g (x:xs) ys | xs' `isInfixOf` ys = x : g xs ys %o A048992 | otherwise = g xs (xs' ++ ys) %o A048992 where xs' = reverse $ show x %o A048992 -- _Reinhard Zumkeller_, Dec 05 2011 %o A048992 (PARI) D=[]; for(n=1, 999, for(i=0, #D-#d=digits(n), D[i+1..i+#d]!=d || print1(n",") || next(2)); D=concat(D, d)) \\ _M. F. Hasler_, Oct 25 2019 %Y A048992 Complement of A048991. %Y A048992 Similar to A116700: "early birds" in the Barbier word A007376 or Champernowne sequence A033307. %K A048992 nonn,nice,base,easy,look %O A048992 1,1 %A A048992 _Bernardo Recamán_ %E A048992 Edited by _Patrick De Geest_, Jun 02 2003