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

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

%S 13,4826809,1792160394037,665416609183179841,247064529073450392704413,

%T 91733330193268616658399616009,34059943367449284484947168626829637,

%U 12646218552730347184269489080961456410641,4695452425098908797088971409337422035076128813

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

%H Vincenzo Librandi, <a href="/A013866/b013866.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+1): 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 24 13:23 EDT 2024. Contains 371955 sequences. (Running on oeis4.)