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 A165242 #12 Apr 13 2019 22:13:24 %S A165242 5,7,5,3,7,3,5,1,7,5,3,7,5,1,7,5,1,7,3,1,5,5,1,7,3,3,1,3,3,5,3,7,5,3, %T A165242 3,5,1,3,7,5,1,7,7,3,7,1,5,5,3,1,1,5,5,3,3,5,1,7,5,7,7,5,3,1,1,3,7,7, %U A165242 5,7,5,7,7,1,3,1,1,3,7,3,3,1,1,1,5,3,5,3,1,5,7,7,5,1,5,7,7,1,1,7,5,7,3,3,5 %N A165242 The larger member of the n-th twin prime pair, modulo 8. %C A165242 Related to the rank of some elliptic curves by the conjecture on page 2 of [Hatley]: %C A165242 Let E_p be the elliptic curve defined by y^2 = x(x-p)(x-2) where p and p-2 are twin primes. %C A165242 Then Rank(E_p) = 0 if p == 7 (mod 8), 1 if p == 3,5 (mod 8), 2 if p == 1 (mod 8). %D A165242 Joseph H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, 1986. %H A165242 Jeffrey Hatley, <a href="http://arxiv.org/abs/0909.1614">On the Rank of the Elliptic Curve y^2=x(x-p)(x-2)</a>, arXiv:0909.1614 [math.NT], 2009. %F A165242 a(n) = A010877(A006512(n)). %p A165242 A006512 := proc(n) if n = 1 then 5; else for a from procname(n-1)+2 by 2 do if isprime(a) and isprime(a-2) then RETURN(a) ; fi; od: fi; end: %p A165242 A165242 := proc(n) A006512(n) mod 8 ; end: seq(A165242(n),n=1..120) ; # _R. J. Mathar_, Sep 16 2009 %t A165242 Mod[#,8]&/@(Select[Partition[Prime[Range[800]],2,1],#[[2]]-#[[1]]==2&][[All,2]]) (* _Harvey P. Dale_, Sep 26 2016 *) %Y A165242 Cf. A000040, A001359, A010877. %K A165242 easy,nonn %O A165242 1,1 %A A165242 _Jonathan Vos Post_, Sep 09 2009 %E A165242 Redefined for the larger member of twin primes by _R. J. Mathar_, Sep 16 2009