cp's OEIS Frontend

A017473 a(n) = 11*n + 7.

%I A017473 #31 Sep 08 2022 08:44:42
%S A017473 7,18,29,40,51,62,73,84,95,106,117,128,139,150,161,172,183,194,205,
%T A017473 216,227,238,249,260,271,282,293,304,315,326,337,348,359,370,381,392,
%U A017473 403,414,425,436,447,458,469,480,491,502,513,524,535,546,557,568,579,590
%N A017473 a(n) = 11*n + 7.
%H A017473 Vincenzo Librandi, <a href="/A017473/b017473.txt">Table of n, a(n) for n = 0..10000</a>
%H A017473 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A017473 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A017473 From _Colin Barker_, Jun 06 2012: (Start)
%F A017473 a(n) = 2*a(n-1) - a(n-2).
%F A017473 G.f.: (7 + 4*x)/(1-x)^2. (End)
%F A017473 E.g.f.: (7 + 11*x)*exp(x). - _G. C. Greubel_, Sep 19 2019
%p A017473 seq(11*n+7, n=0..60); # _G. C. Greubel_, Sep 19 2019
%t A017473 Range[7, 1000, 11] (* _Vladimir Joseph Stephan Orlovsky_, May 29 2011 *)
%o A017473 (Magma) [(11*n+7): n in [0..60]]; // _Vincenzo Librandi_, Sep 04 2011
%o A017473 (PARI) vector(60, n, 11*n-4) \\ _G. C. Greubel_, Sep 19 2019
%o A017473 (Sage) [11*n+7 for n in (0..60)] # _G. C. Greubel_, Sep 19 2019
%o A017473 (GAP) List([0..60], n-> 11*n+7); # _G. C. Greubel_, Sep 19 2019
%Y A017473 Cf. A008593, A017401, A017413.
%Y A017473 Powers of the form (11*n+7)^m: this sequence (m=1), A017474 (m=2), A017475 (m=3), A017476 (m=4), A017477 (m=5), A017478 (m=6), A017479 (m=7), A017480 (m=8), A017481 (m=9), A017482 (m=10), A017483 (m=11), A017484 (m=12).
%K A017473 nonn,easy
%O A017473 0,1
%A A017473 _N. J. A. Sloane_