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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

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

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (1296).

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: A048100 A222337 A008697 * A100509 A013840 A253780

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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 10 04:09 EST 2016. Contains 278993 sequences.