|
%I #24 Sep 08 2022 08:44:38
%S 6,7776,10077696,13060694016,16926659444736,21936950640377856,
%T 28430288029929701376,36845653286788892983296,
%U 47751966659678405306351616,61886548790943213277031694336,80204967233062404407033075859456
%N a(n) = 6^(4*n + 1).
%H Vincenzo Librandi, <a href="/A013784/b013784.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 (1296).
%F From _Philippe Deléham_, Nov 30 2008: (Start)
%F a(n) = 1296*a(n-1); a(0)=6.
%F G.f.: 6/(1-1296*x). (End)
%t 6^(4*Range[0,20]+1) (* or *) NestList[1296#&,6,20] (* _Harvey P. Dale_, May 30 2018 *)
%o (Magma) [6^(4*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 28 2011
%o (Maxima) makelist(6^(4*n+1),n,0,20); /* _Martin Ettl_, Oct 21 2012 */
%o (PARI) a(n)=6^(4*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 