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 A076338 #28 Sep 08 2022 08:45:07
%S A076338 1,513,1025,1537,2049,2561,3073,3585,4097,4609,5121,5633,6145,6657,
%T A076338 7169,7681,8193,8705,9217,9729,10241,10753,11265,11777,12289,12801,
%U A076338 13313,13825,14337,14849,15361,15873,16385,16897,17409,17921,18433
%N A076338 a(n) = 512*n + 1.
%C A076338 First prime is a(15) = 7681, see A076339.
%H A076338 Vincenzo Librandi, <a href="/A076338/b076338.txt">Table of n, a(n) for n = 0..10000</a>
%H A076338 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A076338 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A076338 G.f.: (1+511*x)/(1-x)^2. - _Vincenzo Librandi_, Feb 23 2012
%F A076338 a(n) = 2*a(n-1)-a(n-2). - _Vincenzo Librandi_, Feb 23 2012
%t A076338 LinearRecurrence[{2, -1}, {1, 513}, 50] (* _Vincenzo Librandi_, Feb 23 2012 *)
%o A076338 (Magma) I:=[1, 513]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; // _Vincenzo Librandi_, Feb 23 2012
%o A076338 (PARI) for(n=0, 50, print1(512*n+1", ")); \\ _Vincenzo Librandi_, Feb 23 2012
%o A076338 (Haskell)
%o A076338 a076338 n = (+ 1) . (* 512)
%o A076338 a076338_list = [1,513..] -- _Reinhard Zumkeller_, Mar 08 2012
%Y A076338 Cf. A076339.
%K A076338 nonn,easy
%O A076338 0,2
%A A076338 _Reinhard Zumkeller_, Oct 07 2002