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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013752 a(n) = 13^(3*n + 1). 2
13, 28561, 62748517, 137858491849, 302875106592253, 665416609183179841, 1461920290375446110677, 3211838877954855105157369, 7056410014866816666030739693 (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

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

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

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

a(n) = A013753(n)/13. (End)

PROG

(MAGMA) [13^(3*n+1): n in [0..15]]; // Vincenzo Librandi, Jun 27 2011

(PARI) a(n)=13^(3*n+1) \\ Charles R Greathouse IV, Jun 27 2011

CROSSREFS

Subsequence of A001022.

Sequence in context: A123921 A145716 A124990 * A076811 A203691 A220981

Adjacent sequences:  A013749 A013750 A013751 * A013753 A013754 A013755

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 13 17:47 EST 2018. Contains 317149 sequences. (Running on oeis4.)