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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013749 a(n) = 11^(3*n + 2). 2
121, 161051, 214358881, 285311670611, 379749833583241, 505447028499293771, 672749994932560009201, 895430243255237372246531, 1191817653772720942460132761, 1586309297171491574414436704891, 2111377674535255285545615254209921 (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)=121.

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

a(n) = 11*A013748(n). (End)

MAPLE

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

MATHEMATICA

NestList[1331#&, 121, 10] (* Harvey P. Dale, Dec 24 2014 *)

PROG

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

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

CROSSREFS

Cf. A013748.

Sequence in context: A195275 A082489 A028463 * A178192 A135825 A221392

Adjacent sequences:  A013746 A013747 A013748 * A013750 A013751 A013752

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 16 00:11 EST 2018. Contains 317252 sequences. (Running on oeis4.)