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 A003619 M2300 #23 Oct 06 2017 20:15:18
%S A003619 1,3,4,5,6,8,9,10,11,12,13,14,15,16,17,18,19,21,22,23,24,25,26,27,28,
%T A003619 29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,
%U A003619 52,53
%N A003619 Not of form [ e^m ], m >= 1.
%C A003619 If 1 is excluded (of form [e^0]) then complement of A000149. - _Michel Marcus_, Jun 16 2013
%D A003619 J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 11.
%D A003619 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A003619 Reinhard Zumkeller, <a href="/A003619/b003619.txt">Table of n, a(n) for n = 1..10000</a>
%H A003619 J. Lambek and L. Moser, <a href="http://www.jstor.org/stable/2308078">Inverse and complementary sequences of natural numbers</a>, Amer. Math. Monthly, 61 (1954), 454-458.
%F A003619 a(n) = n + [ log (n + 1 + [ log (n + 1) ]) ].
%t A003619 Table[n + Floor@ Log[n + 1 + Floor@ Log[n + 1]], {n, 50}] (* _Michael De Vlieger_, Oct 06 2017 *)
%o A003619 (PARI) a(n) = n + floor( log (n + 1 + floor( log (n + 1) )) ) \\ _Michel Marcus_, Jun 16 2013
%o A003619 (Haskell)
%o A003619 a003619 n = n + floor (log (x + fromIntegral (floor $ log x)))
%o A003619 where x = fromIntegral n + 1
%o A003619 -- _Reinhard Zumkeller_, Mar 17 2015
%Y A003619 Cf. A000195.
%K A003619 nonn
%O A003619 1,2
%A A003619 _N. J. A. Sloane_, _Mira Bernstein_