login
a(n) = 23*n + 1.
2

%I #13 Aug 15 2025 02:27:37

%S 1,24,47,70,93,116,139,162,185,208,231,254,277,300,323,346,369,392,

%T 415,438,461,484,507,530,553,576,599,622,645,668,691,714,737,760,783,

%U 806,829,852,875,898,921,944,967,990,1013,1036,1059,1082,1105,1128,1151,1174

%N a(n) = 23*n + 1.

%H Jeremy Gardiner, <a href="/A215148/b215148.txt">Table of n, a(n) for n = 0..999</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F From _G. C. Greubel_, Apr 19 2018: (Start)

%F a(n) = 2*a(n-1) - a(n-2).

%F G.f.: (1+22*x)/(1-x)^2.

%F E.g.f.: (23*x + 1)*exp(x). (End)

%t Range[1, 1000, 23]

%t LinearRecurrence[{2,-1}, {1,24}, 50] (* _G. C. Greubel_, Apr 19 2018 *)

%o (PARI) for(n=0, 50, print1(23*n + 1, ", ")) \\ _G. C. Greubel_, Apr 19 2018

%o (Magma) I:=[1,24]; [n le 2 select I[n] else 2*Self(n-1) - Self(n-2): n in [1..30]]; // _G. C. Greubel_, Apr 19 2018

%Y Cf. A103214, A120344, A161709.

%K nonn,easy

%O 0,2

%A _Jeremy Gardiner_, Aug 04 2012