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 A261525 #8 Nov 13 2016 17:04:34 %S A261525 2,3,9,8,15,23,47,29,66,114,46,220,188,258,640,375,480,589,216,326, %T A261525 367,1006,738,1183,1985,1847,1662,2224,3731,3861,3561,2699,3792,4521, %U A261525 2225,12541,3384,12761,3385,4058,10228,15747,15927,14357,18280,19025,14123 %N A261525 a(n) = smallest m such that A031131(m) = 2*n. %C A261525 A031131(a(n)) = 2*n and A031131(m) != 2*n for m < a(n); %C A261525 A046931(n) = A000040(a(n)+1); %C A261525 a(n)-th and (a(n)+2)-nd primes are the first pair that differ by 2*n; %C A261525 conjecture: sequence is defined for all n > 1. %H A261525 Reinhard Zumkeller, <a href="/A261525/b261525.txt">Table of n, a(n) for n = 2..100</a> %o A261525 (Haskell) %o A261525 a261525 = (+ 1) . fromJust . (`elemIndex` a031131_list) . (* 2) %Y A261525 Cf. A031131, A038664, A046931. %K A261525 nonn %O A261525 2,1 %A A261525 _Reinhard Zumkeller_, Aug 23 2015