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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013785 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

Vincenzo Librandi, Table of n, a(n) for n = 0..200

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). [From Philippe Deléham, Nov 30 2008]

MATHEMATICA

lst={}; Do[AppendTo[lst, 6^(4*n+3)], {n, 0, 5!}]; lst [From 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: A048100 A222337 A008697 * A100509 A013840 A134370

Adjacent sequences:  A013782 A013783 A013784 * A013786 A013787 A013788

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified July 30 15:30 EDT 2014. Contains 245069 sequences.