|
%I #23 Sep 08 2022 08:45:15
%S 101,198,295,392,489,586,683,780,877,974,1071,1168,1265,1362,1459,
%T 1556,1653,1750,1847,1944,2041,2138,2235,2332,2429,2526,2623,2720,
%U 2817,2914,3011,3108,3205,3302,3399,3496,3593,3690,3787,3884,3981,4078,4175,4272
%N a(n) = 97*n + 101.
%C Note that 97 is the largest two-digit prime and 101 is the smallest three-digit prime.
%H Vincenzo Librandi, <a href="/A100775/b100775.txt">Table of n, a(n) for n = 0..10000</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2, -1).
%F a(n) = 2*a(n-1) - a(n-2); a(0)=101, a(1)=198. - _Harvey P. Dale_, Nov 26 2013
%F G.f.: (101-4*x)/(x-1)^2. - _Harvey P. Dale_, Nov 26 2013
%e If n=1, then 97*1 + 101 = 198.
%t 97*Range[0,50]+101 (* or *) LinearRecurrence[{2,-1},{101,198},50] (* _Harvey P. Dale_, Nov 26 2013 *)
%o (Magma) [97*n + 101: n in [0..50]]; // _Vincenzo Librandi_, Jul 14 2011
%o (PARI) a(n)=97*n+101 \\ _Charles R Greathouse IV_, Oct 16 2015
%Y Cf. A101084, A017029, A100776, A101442.
%K nonn,easy
%O 0,1
%A _Parthasarathy Nambi_, Jan 03 2005
%E More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 19 2005
%E Edited by _Ray Chandler_, Jan 25 2005
|
