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

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

%S 50625,38443359375,29192926025390625,22168378200531005859375,

%T 16834112196028232574462890625,12783403948858939111232757568359375,

%U 9707397373664756887592375278472900390625,7371554880626674761515459977090358734130859375

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

%H Vincenzo Librandi, <a href="/A013877/b013877.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 (759375).

%t 15^(5*Range[0,10]+4) (* _Harvey P. Dale_, Jun 10 2014 *)

%o (Magma) [15^(5*n+4): n in [0..10]]; // _Vincenzo Librandi_, Jul 10 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 18 20:10 EDT 2024. Contains 371781 sequences. (Running on oeis4.)