This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A119413 #24 Apr 04 2025 03:13:16 %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,788,804,820,836 %N A119413 a(n) = 16*n - 12. %C A119413 General form: (q*n+1)*q: q=2: A016825, q=3: A017197, q=4: A119413, ... . - _Vladimir Joseph Stephan Orlovsky_, Feb 16 2009 %H A119413 Vincenzo Librandi, <a href="/A119413/b119413.txt">Table of n, a(n) for n = 1..5000</a> %H A119413 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A119413 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A119413 O.g.f.: 4*x*(1+3*x)/(1-x)^2. - _R. J. Mathar_, Aug 08 2008 %F A119413 From _Elmo R. Oliveira_, Apr 03 2025: (Start) %F A119413 E.g.f.: 4*(exp(x)*(4*x - 3) + 3). %F A119413 a(n) = 2*a(n-1) - a(n-2) for n > 2. %F A119413 a(n) = 4*A016813(n-1) = 2*A017089(n-1). (End) %t A119413 Range[4, 1000, 16] (* _Vladimir Joseph Stephan Orlovsky_, May 31 2011 *) %o A119413 (PARI) for(x=1,100,print1(16*x-12,", ")) %o A119413 (Magma) [16*n-12: n in [1..60]]; // _Vincenzo Librandi_, Jul 23 2011 %Y A119413 Cf. A044446, A085805, A016825, A017197, A119413. %Y A119413 Cf. A016813, A017089. %K A119413 nonn,less,easy %O A119413 1,1 %A A119413 _Jorge Coveiro_, Jul 26 2006