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 A100776 #26 Dec 08 2024 14:17:42
%S A100776 1009,2006,3003,4000,4997,5994,6991,7988,8985,9982,10979,11976,12973,
%T A100776 13970,14967,15964,16961,17958,18955,19952,20949,21946,22943,23940,
%U A100776 24937,25934,26931,27928,28925,29922,30919,31916,32913,33910,34907,35904,36901,37898,38895
%N A100776 a(n) = 997*n + 1009.
%C A100776 Note that 997 is the largest three-digit prime and 1009 is the smallest four-digit prime.
%H A100776 Vincenzo Librandi, <a href="/A100776/b100776.txt">Table of n, a(n) for n = 0..10000</a>
%H A100776 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A100776 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A100776 From _Elmo R. Oliveira_, Dec 07 2024: (Start)
%F A100776 G.f.: (1009 - 12*x)/(1 - x)^2.
%F A100776 E.g.f.: (1009 + 997*x)*exp(x).
%F A100776 a(n) = 2*a(n-1) - a(n-2) for n > 1. (End)
%e A100776 If n=1, 997*1 + 1009 = 2006.
%e A100776 If n=2, 997*2 + 1009 = 3003.
%p A100776 A100776:=n->997 * n + 1009; seq(A100776(n), n=0..50); # _Wesley Ivan Hurt_, Jan 22 2014
%t A100776 Table[997 n + 1009, {n, 0, 50}] (* _Wesley Ivan Hurt_, Jan 22 2014 *)
%o A100776 (Magma) [997 * n + 1009: n in [0..50]]; // _Vincenzo Librandi_, Jul 14 2011
%o A100776 (PARI) a(n)=997*n+1009 \\ _Charles R Greathouse IV_, Jul 10 2016
%Y A100776 Cf. A017029, A100775, A101086, A101442.
%K A100776 nonn,easy
%O A100776 0,1
%A A100776 _Parthasarathy Nambi_, Jan 03 2005
%E A100776 More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 19 2005
%E A100776 Edited by _Ray Chandler_, Jan 25 2005