cp's OEIS Frontend

A161709 a(n) = 22*n + 1.

%I A161709 #21 Sep 08 2022 08:45:45
%S A161709 1,23,45,67,89,111,133,155,177,199,221,243,265,287,309,331,353,375,
%T A161709 397,419,441,463,485,507,529,551,573,595,617,639,661,683,705,727,749,
%U A161709 771,793,815,837,859,881,903,925,947,969,991,1013,1035,1057,1079,1101,1123
%N A161709 a(n) = 22*n + 1.
%D A161709 Italo Ghersi, Matematica dilettevole e curiosa, p. 139, Hoepli, Milano, 1967. [From _Vincenzo Librandi_, Dec 02 2009]
%H A161709 G. C. Greubel, <a href="/A161709/b161709.txt">Table of n, a(n) for n = 0..1000</a>
%H A161709 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A161709 From _G. C. Greubel_, Sep 18 2019: (Start)
%F A161709 a(n) = 2*a(n-1) - a(n-2).
%F A161709 G.f.: (1 + 21*x)/(1-x)^2.
%F A161709 E.g.f.: (1 + 22*x)*exp(x). (End)
%p A161709 seq(1+22*n, n=0..60); # _G. C. Greubel_, Sep 18 2019
%t A161709 22*Range[0,60]+1 (* _Harvey P. Dale_, Jan 09 2011 *)
%o A161709 (PARI) vector(60, n, 22*n-21) \\ _G. C. Greubel_, Sep 18 2019
%o A161709 (Magma) [1+22*n: n in [0..60]]; // _G. C. Greubel_, Sep 18 2019
%o A161709 (Sage) [1+22*n for n in (0..60)] # _G. C. Greubel_, Sep 18 2019
%o A161709 (GAP) List([0..60], n-> 1+22*n ); # _G. C. Greubel_, Sep 18 2019
%Y A161709 Cf. A005408, A008604, A016813, A016921, A017281, A017533, A128470, A158057, A161700, A161705, A161714.
%K A161709 nonn,easy
%O A161709 0,2
%A A161709 _Reinhard Zumkeller_, Jun 17 2009