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 A085500 #19 Sep 06 2024 15:17:13
%S A085500 1,2,3,4,6,8,9,11,15,16,18,21,23,24,30,62,66,99,154,189,217,1059,1183,
%T A085500 1532,1663,1831,2225,2810,3385,14357,29040,30802,31545,40933,103520,
%U A085500 104071,118505,149689,325852,733588,983015,1094421,1319945,2850174,6957876,10539432,10655462
%N A085500 Indices of primes where nondecreasing gaps occur.
%C A085500 A005669 is a subsequence of this sequence.
%D A085500 Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section A8, pp. 31-39.
%H A085500 Jeff Young and Aaron Potler, <a href="https://doi.org/10.1090/S0025-5718-1989-0947470-1">First occurrence prime gaps</a>, Math. Comp., 52 (1989), 221-224.
%F A085500 a(n) = A000720(A134266(n)). - _M. F. Hasler_, Apr 26 2014
%t A085500 f[n_] := Prime[n+1]-Prime[n]; v1={}; v2={}; Do[If[f[n]>=If[n==1, 1, Last[v2]], v=n; v1=Append[v1, n]; v2=Append[v2, f[v]]; Print[v1]], {n, 105000000}]
%Y A085500 Cf. A085237, A005669, A005250, A134266.
%Y A085500 See also A214935(n) = A000720(A205827(n)), A241540(n) = A000720(A182514(n)).
%K A085500 nonn
%O A085500 1,2
%A A085500 _Farideh Firoozbakht_, Aug 15 2003
%E A085500 a(45)-a(47) from _Amiram Eldar_, Sep 05 2024