|
%I #38 Jan 15 2023 18:29:58
%S 0,18,36,54,72,90,108,126,144,162,180,198,216,234,252,270,288,306,324,
%T 342,360,378,396,414,432,450,468,486,504,522,540,558,576,594,612,630,
%U 648,666,684,702,720,738,756,774,792,810,828,846,864,882,900,918,936
%N Multiples of 18.
%H Vincenzo Librandi, <a href="/A008600/b008600.txt">Table of n, a(n) for n = 0..1000</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=330">Encyclopedia of Combinatorial Structures 330</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2, -1).
%F G.f.: 18*x/(x-1)^2. - _Vincenzo Librandi_, Jun 10 2013
%t Range[0, 1000, 18] (* _Vladimir Joseph Stephan Orlovsky_, Jun 01 2011 *)
%t CoefficientList[Series[18 x / (x - 1)^2, {x, 0, 60}], x] (* _Vincenzo Librandi_, Jun 10 2013 *)
%t 18*Range[0,60] (* _Harvey P. Dale_, Jan 15 2023 *)
%o (PARI) a(n)=18*n \\ _Charles R Greathouse IV_, Sep 24 2015
%Y Cf. A008598, A154612.
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_
|
