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

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

%S 15,759375,38443359375,1946195068359375,98526125335693359375,

%T 4987885095119476318359375,252511682940423488616943359375,

%U 12783403948858939111232757568359375,647159824910983792506158351898193359375

%N a(n) = 15^(4*n + 1).

%H Vincenzo Librandi, <a href="/A013802/b013802.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 (50625).

%o (Magma) [15^(4*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jul 06 2011

%o (Maxima) makelist(15^(4*n+1),n,0,20); /* _Martin Ettl_, Oct 21 2012 */

%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 25 13:27 EDT 2024. Contains 371971 sequences. (Running on oeis4.)