%I A119413
%S A119413 4,20,36,52,68,84,100,116,132,148,164,180,196,212,228,244,260,276,292,
%T A119413 308,324,340,356,372,388,404,420,436,452,468,484,500,516,532,548,564,
%U A119413 580,596,612,628,644,660,676,692,708,724,740,756,772
%N A119413 16*n-12.
%C A119413 General form: (q*n+1)*q q=2=A016825, q=3=A017197, q=4=A119413, ... [From 
               Vladimir Orlovsky (4vladimir(AT)gmail.com), Feb 16 2009]
%H A119413 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A119413 O.g.f.: 4x(1+3x)/(1-x)^2. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Aug 08 2008]
%t A119413 q=4;lst={};Do[AppendTo[lst,(q*n+1)*q],{n,0,5!}];lst [From Vladimir Orlovsky 
               (4vladimir(AT)gmail.com), Feb 16 2009]
%o A119413 (PARI) for(x=1,100,print1(16*x-12,", "))
%Y A119413 Cf. A085805 A044446.
%Y A119413 Sequence in context: A043880 A030002 A085805 this_sequence A044446 A072977 
               A163365
%Y A119413 Adjacent sequences: A119410 A119411 A119412 this_sequence A119414 A119415 
               A119416
%K A119413 nonn,less
%O A119413 1,1
%A A119413 Jorge Coveiro (jorgecoveiro(AT)yahoo.com), Jul 26 2006