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!)
A013869 a(n) = 13^(5*n + 4). 1

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

%S 28561,10604499373,3937376385699289,1461920290375446110677,

%T 542800770374370512771595361,201538126434611150798503956371773,

%U 74829695578286078013428929473144712489,27783742160348572763840067510872319734178277

%N a(n) = 13^(5*n + 4).

%H Vincenzo Librandi, <a href="/A013869/b013869.txt">Table of n, a(n) for n = 0..100</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 (371293).

%o (Magma) [13^(5*n+4): n in [0..10]]; // _Vincenzo Librandi_, Jul 09 2011

%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 26 01:44 EDT 2024. Contains 371989 sequences. (Running on oeis4.)