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!)
A013717 a(n) = 12^(2*n + 1). 3

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

%S 12,1728,248832,35831808,5159780352,743008370688,106993205379072,

%T 15407021574586368,2218611106740436992,319479999370622926848,

%U 46005119909369701466112,6624737266949237011120128

%N a(n) = 12^(2*n + 1).

%H Vincenzo Librandi, <a href="/A013717/b013717.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 (144).

%F From _Philippe Deléham_, Nov 25 2008: (Start)

%F a(n) = 144*a(n-1), a(0)=12.

%F G.f.: 12/(1-144*x). (End)

%p seq(12^(2*n+1),n=0..11); # _Nathaniel Johnston_, Jun 25 2011

%o (Magma) [12^(2*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011

%o (PARI) a(n)=12^(2*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016

%Y Bisection of A001021.

%Y Cf. A013708-A013716, A013718-A013729.

%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 19 11:31 EDT 2024. Contains 371792 sequences. (Running on oeis4.)