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 A036277 #25 May 10 2023 10:30:01
%S A036277 2,4,9,15,15,26,25,24,23,26,60,99,98,99,98,175,177,177,177,177,292,
%T A036277 291,290,741,875,874,873,874,873,872,871,870,869,868,867,2181,2180,
%U A036277 2179,2178,2772,2771,2770,2769,2768,2767,2766,2765,2764,2764,2764,2764,3367
%N A036277 Position of first term > 2 in n-th row of Gilbreath array shown in A036262.
%C A036277 Gilbreath's conjecture is equivalent to: A036277(n)>A213014(n)+2 for all n>0. See A036262 for a proof. - _M. F. Hasler_, Jun 02 2012
%D A036277 A. S. Fraenkel and B. J. Reuter, On certain sequences of integers and prime numbers, Proc. 2nd National Conf. Data Processing, Rehovoth, Jan 1966, pp. 450-437.
%D A036277 R. K. Guy, Unsolved Problems Number Theory, A10.
%H A036277 T. D. Noe, <a href="/A036277/b036277.txt">Table of n, a(n) for n=0..274</a>
%H A036277 A. M. Odlyzko, <a href="http://dx.doi.org/10.1090/S0025-5718-1993-1182247-7">Iterated absolute values of differences of consecutive primes</a>, Math. Comp., 61 (1993), pp. 373-380.
%F A036277 a(n) = A000232(n)+1. - _R. J. Mathar_, May 10 2023
%e A036277 Row 1 of A036262 is 1 2 2 4 2 4 2 4 ... so a(1) = 4.
%e A036277 [N.B.: While the first row of the table A036261 contains the absolute first differences of the primes, table A036262 starts with the primes themselves in the uppermost row, which is obviously here referred to as the 0th row. - _M. F. Hasler_, Jun 02 2012]
%t A036277 max = 10^4; triangle = NestList[Abs[Differences[#]]&, Prime[Range[max]], max]; a[n_] := (p = Position[triangle[[n+1]], k_ /; k>2, 1, 1]; If[p == {}, Nothing, p[[1, 1]]]); Table[a[n], {n, 0, Sqrt[max]}] (* _Jean-François Alcover_, Feb 06 2016 *)
%K A036277 easy,nice,nonn
%O A036277 0,1
%A A036277 _N. J. A. Sloane_
%E A036277 More terms from _David W. Wilson_, Aug 30 2000