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 A079892 #6 Aug 31 2013 16:59:15 %S A079892 2,6,6,6,6,30,10,10,10,30,12,30,14,30,30,18,18,30,20,30,30,30,24,30, %T A079892 26,30,28,30,33,210,33,33,42,42,42,42,38,42,42,42,44,210,44,60,60,60, %U A079892 48,60,50,60,60,60,54,60,60,60,60,60,62,210,62,66,66,65,66,210,68,70,70,210 %N A079892 Least number > n having one more distinct prime factor than n. %C A079892 A001221(a(n)) = A001221(n) + 1; %C A079892 a(A002110(k)) = A002110(k+1). %H A079892 Reinhard Zumkeller, <a href="/A079892/b079892.txt">Table of n, a(n) for n = 1..10000</a> %o A079892 (Haskell) %o A079892 a079892 n = head [x | x <- [n + 1 ..], a001221 x == 1 + a001221 n] %o A079892 -- _Reinhard Zumkeller_, Aug 29 2013 %Y A079892 Cf. A079893, A079890. %Y A079892 Cf. A165713. %K A079892 nonn %O A079892 1,1 %A A079892 _Reinhard Zumkeller_, Jan 14 2003