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!)
A013785 a(n) = 6^(4n+3). 1

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

%S 216,279936,362797056,470184984576,609359740010496,789730223053602816,

%T 1023490369077469249536,1326443518324400147398656,

%U 1719070799748422591028658176,2227915756473955677973140996096,2887378820390246558653190730940416

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

%H Vincenzo Librandi, <a href="/A013785/b013785.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 a(n) = 1296*a(n-1), n>0; a(0)=216. G.f.: 216/(1-1296*x). a(n) = 36*A013784(n). - _Philippe Deléham_, Nov 30 2008

%t lst={}; Do[AppendTo[lst,6^(4*n+3)],{n,0,5!}]; lst (* _Vladimir Joseph Stephan Orlovsky_, Jan 15 2009 *)

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

%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 March 29 03:51 EDT 2024. Contains 371264 sequences. (Running on oeis4.)