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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013748 a(n) = 11^(3*n + 1). 2
11, 14641, 19487171, 25937424601, 34522712143931, 45949729863572161, 61159090448414546291, 81402749386839761113321, 108347059433883722041830251, 144209936106499234037676064081, 191943424957750480504146841291811 (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 (1331).

FORMULA

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

a(n) = 1331*a(n-1); a(0)=11.

G.f.: 11/(1-1331*x).

a(n) = A013749(n)/11. (End)

MAPLE

seq(11^(3*n+1), n=0..10); # Nathaniel Johnston, Jun 26 2011

PROG

(MAGMA) [11^(3*n+1): n in [0..15]]; // Vincenzo Librandi, Jun 26 2011

(PARI) a(n)=11^(3*n+1) \\ Charles R Greathouse IV, Jul 11 2016

CROSSREFS

Cf. A013749.

Sequence in context: A220979 A125546 A061965 * A076783 A249645 A145526

Adjacent sequences:  A013745 A013746 A013747 * A013749 A013750 A013751

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 November 21 00:36 EST 2018. Contains 317427 sequences. (Running on oeis4.)