login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013729 a(n) = 24^(2*n + 1). 14

%I

%S 24,13824,7962624,4586471424,2641807540224,1521681143169024,

%T 876488338465357824,504857282956046106624,290797794982682557415424,

%U 167499529910025153071284224,96479729228174488169059713024

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

%H Vincenzo Librandi, <a href="/A013729/b013729.txt">Table of n, a(n) for n = 0..100</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 (576).

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

%F a(n) = 576*a(n-1); a(0)=24.

%F G.f.: 24/(1-576*x).

%F a(n) = A013713(n)*A013708(n). (End)

%p seq(24^(2*n+1),n=0..10); # _Nathaniel Johnston_, Jun 26 2011

%o (MAGMA) [24^(2*n+1): n in [0..15]]; // _Vincenzo Librandi_, May 25 2011

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

%Y Cf. A013708-A013728.

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 22 15:52 EST 2019. Contains 320399 sequences. (Running on oeis4.)