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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013753 13^(3n+2). 2
169, 371293, 815730721, 1792160394037, 3937376385699289, 8650415919381337933, 19004963774880799438801, 41753905413413116367045797, 91733330193268616658399616009, 201538126434611150798503956371773, 442779263776840698304313192148785281, 972786042517719014174576083150881262357 (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 (2197).

FORMULA

a(n)=2197*a(n-1), n>0 ; a(0)=169 . G.f.: 169/(1-2197*x). a(n)=13*A013752(n) . [From Philippe Deléham, Nov 30 2008]

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

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

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 March 28 02:00 EDT 2017. Contains 284182 sequences.