A013753 a(n) = 13^(3*n + 2).

169, 371293, 815730721, 1792160394037, 3937376385699289, 8650415919381337933, 19004963774880799438801, 41753905413413116367045797, 91733330193268616658399616009, 201538126434611150798503956371773, 442779263776840698304313192148785281, 972786042517719014174576083150881262357

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 (2197).

Formula

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

a(n) = 2197*a(n-1); a(0)=169.

G.f.: 169/(1-2197*x).

a(n) = 13*A013752(n). (End)

Mathematica

13^(3*Range[0, 20]+2) (* or *) NestList[2197*#&, 169, 20] (* Harvey P. Dale, Oct 10 2019 *)

Prog

(Magma) [13^(3*n+2): n in [0..15]]; // Vincenzo Librandi, Jun 27 2011
(PARI) a(n)=13^(3*n+2) \\ Charles R Greathouse IV, Jun 27 2011

Crossrefs

Subsequence of A001022.

Sequence in context: A135824 A195219 A195276 * A013867 A074666 A043658

Adjacent sequences: A013750 A013751 A013752 * A013754 A013755 A013756

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved