|
%I #21 Sep 08 2022 08:45:25
%S 4,20,36,52,68,84,100,116,132,148,164,180,196,212,228,244,260,276,292,
%T 308,324,340,356,372,388,404,420,436,452,468,484,500,516,532,548,564,
%U 580,596,612,628,644,660,676,692,708,724,740,756,772,788,804,820,836
%N 16*n-12.
%C General form: (q*n+1)*q: q=2: A016825, q=3: A017197, q=4: A119413, ... . - _Vladimir Joseph Stephan Orlovsky_, Feb 16 2009
%H Vincenzo Librandi, <a href="/A119413/b119413.txt">Table of n, a(n) for n = 1..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 O.g.f.: 4*x*(1+3*x)/(1-x)^2. - _R. J. Mathar_, Aug 08 2008
%t Range[4, 1000, 16] (* _Vladimir Joseph Stephan Orlovsky_, May 31 2011 *)
%o (PARI) for(x=1,100,print1(16*x-12,", "))
%o (Magma) [16*n-12: n in [1..60]]; // _Vincenzo Librandi_, Jul 23 2011
%Y Cf. A085805, A044446.
%K nonn,less,easy
%O 1,1
%A _Jorge Coveiro_, Jul 26 2006
|
