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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013751 a(n) = 12^(3*n + 2). 2
144, 248832, 429981696, 743008370688, 1283918464548864, 2218611106740436992, 3833759992447475122176, 6624737266949237011120128, 11447545997288281555215581184 (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 (1728).

FORMULA

From Philippe Deléham, Nov 30 2008: (Start)

a(n) = 1728*a(n-1); a(0)=144.

G.f.: 144/(1-1728*x).

a(n) = 12*A013750(n). (End)

PROG

(MAGMA) [12^(3*n+2): n in [0..15]]; // Vincenzo Librandi, Jun 27 2011

(PARI) a(n)=12^(3*n+2) \\ Charles R Greathouse IV, Jun 27 2011

CROSSREFS

Subsequence of A001021.

Sequence in context: A047807 A023112 A159424 * A033514 A086778 A227652

Adjacent sequences:  A013748 A013749 A013750 * A013752 A013753 A013754

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 16 03:34 EST 2018. Contains 318158 sequences. (Running on oeis4.)