|
%I #26 Sep 08 2022 08:44:42
%S 8,18,28,38,48,58,68,78,88,98,108,118,128,138,148,158,168,178,188,198,
%T 208,218,228,238,248,258,268,278,288,298,308,318,328,338,348,358,368,
%U 378,388,398,408,418,428,438,448,458,468,478,488,498,508,518,528,538
%N a(n) = 10n + 8.
%H Vincenzo Librandi, <a href="/A017365/b017365.txt">Table of n, a(n) for n = 0..5000</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). - _Vincenzo Librandi_, May 29 2011
%F G.f.: 2*( 4+x ) / (x-1)^2 . - _R. J. Mathar_, Nov 26 2014
%t Range[8, 1000, 10] (* _Vladimir Joseph Stephan Orlovsky_, May 28 2011 *)
%t LinearRecurrence[{2,-1},{8,18},60] (* _Harvey P. Dale_, Aug 31 2015 *)
%o (Magma) [10*n+8: n in [0..60]]; // _Vincenzo Librandi_, May 29 2011
%Y 2*A016897(n).
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
|
