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 A158611 #38 Sep 08 2022 08:45:43
%S A158611 0,1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,
%T A158611 89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,
%U A158611 179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263
%N A158611 0, 1 and the primes.
%C A158611 Essentially a duplicate of A008578. - _N. J. A. Sloane_, Mar 27 2009
%C A158611 Or, nonnegative noncomposite numbers. - _Juri-Stepan Gerasimov_, Nov 22 2009, Dec 12 2009
%C A158611 Numbers with all divisors in arithmetic progression. - _Charles R Greathouse IV_, Oct 19 2015
%F A158611 a(n) = A008578(n-1), n > 1.
%t A158611 Join[{0, 1}, Table[Prime[n], {n, 400}]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 04 2012 *)
%o A158611 (PARI) a(n)=if(n<3,n-1,prime(n-2)) \\ _Charles R Greathouse IV_, Aug 26 2011
%o A158611 (Magma) [0,1] cat [NthPrime(n): n in [1..100]]; // _Vincenzo Librandi_, Dec 08 2015
%o A158611 (GAP)
%o A158611 A158611:=Concatenation([0,1],Filtered([1..10^5],IsPrime)); # _Muniru A Asiru_, Sep 05 2017
%Y A158611 A158611 U A002808 = A141468 U A000040 = A001477. - _Juri-Stepan Gerasimov_, Sep 27 2009
%Y A158611 Cf. A008578.
%K A158611 nonn,easy
%O A158611 1,3
%A A158611 _Jaroslav Krizek_, Mar 22 2009
%E A158611 Edited by _R. J. Mathar_, Aug 21 2009
%E A158611 Further edited by _R. J. Mathar_, _Klaus Brockhaus_ and _N. J. A. Sloane_, Sep 13 2009