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!)
A013839 a(n) = 6^(5n+2). 1

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

%S 36,279936,2176782336,16926659444736,131621703842267136,

%T 1023490369077469249536,7958661109946400884391936,

%U 61886548790943213277031694336,481229803398374426442198455156736,3742042951225759540014535187298779136

%N a(n) = 6^(5n+2).

%H Vincenzo Librandi, <a href="/A013839/b013839.txt">Table of n, a(n) for n = 0..60</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 (7776).

%F a(0) = 36, a(n) = 7776*a(n-1). - _Harvey P. Dale_, Nov 29 2011

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

%t 6^(5*Range[0,10]+2) (* or *) NestList[7776#&,36,10] (* _Harvey P. Dale_, Nov 29 2011 *)

%o (Magma) [6^(5*n+2): n in [0..40]]; // _Vincenzo Librandi_, Apr 25 2011

%K nonn

%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 23:15 EDT 2024. Contains 371798 sequences. (Running on oeis4.)