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
216, 279936, 362797056, 470184984576, 609359740010496, 789730223053602816, 1023490369077469249536, 1326443518324400147398656, 1719070799748422591028658176, 2227915756473955677973140996096, 2887378820390246558653190730940416 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
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
MATHEMATICA
lst={}; Do[AppendTo[lst, 6^(4*n+3)], {n, 0, 5!}]; lst (* Vladimir Joseph Stephan Orlovsky, Jan 15 2009 *)
PROG
(Magma) [6^(4*n+3): n in [0..15]]; // Vincenzo Librandi, Jun 28 2011
CROSSREFS
Sequence in context: A222337 A008697 A282000 * A100509 A013840 A253780
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

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 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)