login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013797 a(n) = 12^(4*n + 3). 1

%I #19 Sep 08 2022 08:44:38

%S 1728,35831808,743008370688,15407021574586368,319479999370622926848,

%T 6624737266949237011120128,137370551967459378662586974208,

%U 2848515765597237675947403497177088,59066822915424320448445358917464096768

%N a(n) = 12^(4*n + 3).

%H Vincenzo Librandi, <a href="/A013797/b013797.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).

%F a(n) = 20736*a(n-1); a(0) = 1728. - _Harvey P. Dale_, Apr 29 2012

%t 12^(4*Range[0,20]+3) (* or *) NestList[20736#&,1728,20] (* _Harvey P. Dale_, Apr 29 2012 *)

%o (Magma) [12^(4*n+3): n in [0..10]]; // _Vincenzo Librandi_, Jun 28 2011

%Y Subsequence of A001021.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:13 EDT 2024. Contains 371936 sequences. (Running on oeis4.)