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 A064424 #10 Mar 31 2012 13:50:42
%S A064424 1,2,4,6,9,12,15,18,21,24,33,35,39,51,57,69,70,87,93,111,123,129,141,
%T A064424 159,177,183,201,213,219,237,249,267,291,303,309,321,327,339,381,393,
%U A064424 411,417,447,453,471,489,501,519,537,543,573,579,591,597
%N A064424 Record high values in A064413.
%C A064424 RECORDS transform of A064413.
%H A064424 T. D. Noe, <a href="/A064424/b064424.txt">Table of n, a(n) for n=1..1000</a>
%H A064424 J. C. Lagarias, E. M. Rains and N. J. A. Sloane, <a href="http://arXiv.org/abs/math.NT/0204011">The EKG sequence</a>, Exper. Math. 11 (2002), 437-446.
%H A064424 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H A064424 <a href="/index/Ed#EKG">Index entries for sequences related to EKG sequence</a>
%o A064424 (PARI) A064424(N,show=0)={ my(a=min(N,2),u=0,L=3,m); show & print1(1); for( k=3,N, m=a; show & print1(", "m); for( i=0,1e9, bittest(u,i) & next; gcd(a,L+i)>1 | next; a=L+i; if( i, u+=1<<i, while( bittest(u,i++),); u>>=i; L+=i); a>m & break; i=-1)); a } \\ - M. F. Hasler, Nov 28 2010
%Y A064424 Cf. A064413, A074177.
%K A064424 nonn,easy
%O A064424 1,2
%A A064424 _N. J. A. Sloane_, Sep 30 2001
%E A064424 More terms from _Naohiro Nomoto_, Apr 21 2002