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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013749 11^(3n+2). 2
121, 161051, 214358881, 285311670611, 379749833583241, 505447028499293771, 672749994932560009201, 895430243255237372246531, 1191817653772720942460132761, 1586309297171491574414436704891, 2111377674535255285545615254209921 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

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

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=1331*a(n-1), n>0 ; a(0)=121 . G.f.: 121/(1-1331*x). a(n)=11*A013748(n). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 30 2008]

MAPLE

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

PROG

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

CROSSREFS

Cf. A013748.

Sequence in context: A195275 A082489 A028463 * A178192 A135825 A082215

Adjacent sequences:  A013746 A013747 A013748 * A013750 A013751 A013752

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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

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

Last modified February 15 05:12 EST 2012. Contains 205694 sequences.