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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013795 a(n) = 11^(4*n+3). 1
1331, 19487171, 285311670611, 4177248169415651, 61159090448414546291, 895430243255237372246531, 13109994191499930367061460371, 191943424957750480504146841291811, 2810243684806424785061213903353404851 (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 (14641).

FORMULA

a(n) = 14641*a(n-1). - Harvey P. Dale, May 26 2016

G.f.: 1331/(1 - 14641x). - Indranil Ghosh, Apr 09 2017

MAPLE

A013795:=n->11^(4*n+3): seq(A013795(n), n=0..10); # Wesley Ivan Hurt, Apr 08 2017

MATHEMATICA

11^(4*Range[0, 10]+3) (* or *) NestList[14641#&, 1331, 10] (* Harvey P. Dale, May 26 2016 *)

CoefficientList[Series[1331/(1- 14641x), {x, 0, 10}], x] (* Indranil Ghosh, Apr 09 2017 *)

PROG

(MAGMA) [11^(4*n+3): n in [0..10]]; // Vincenzo Librandi, Jun 28 2011

(PARI) a(n) = 11^(4*n + 3) \\ Indranil Ghosh, Apr 09 2017

(Python) def a(n): return 11**(4*n + 3) # Indranil Ghosh, Apr 09 2017

CROSSREFS

Subsequence of A001020. - Michel Marcus, Apr 08 2017

Sequence in context: A278936 A263613 A052076 * A013860 A052072 A050646

Adjacent sequences:  A013792 A013793 A013794 * A013796 A013797 A013798

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 May 22 21:40 EDT 2017. Contains 286906 sequences.