login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013752 a(n) = 13^(3*n + 1). 2

%I #27 Sep 08 2022 08:44:38

%S 13,28561,62748517,137858491849,302875106592253,665416609183179841,

%T 1461920290375446110677,3211838877954855105157369,

%U 7056410014866816666030739693

%N a(n) = 13^(3*n + 1).

%H Vincenzo Librandi, <a href="/A013752/b013752.txt">Table of n, a(n) for n = 0..200</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature(2197).

%F From _Philippe Deléham_, Nov 30 2008: (Start)

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

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

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

%o (Magma) [13^(3*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 27 2011

%o (PARI) a(n)=13^(3*n+1) \\ _Charles R Greathouse IV_, Jun 27 2011

%Y Subsequence of A001022.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:06 EDT 2024. Contains 371962 sequences. (Running on oeis4.)