|
%I #22 Sep 08 2022 08:44:38
%S 12,248832,5159780352,106993205379072,2218611106740436992,
%T 46005119909369701466112,953962166440690129601298432,
%U 19781359483314150527412524285952,410186270246002225336426103593500672,8505622499821102144576131684114829934592
%N a(n) = 12^(4*n + 1).
%H Vincenzo Librandi, <a href="/A013796/b013796.txt">Table of n, a(n) for n = 0..200</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (20736).
%t NestList[20736#&,12,20] (* _Harvey P. Dale_, Jun 02 2017 *)
%o (Magma) [12^(4*n+1): n in [0..10]]; // _Vincenzo Librandi_, Jun 28 2011
%o (Maxima) makelist(12^(4*n+1),n,0,20); /* _Martin Ettl_, Oct 21 2012 */
%o (PARI) a(n) = 12^(4*n+1); \\ _Altug Alkan_, Sep 08 2018
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 