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

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

%S 6561,387420489,22876792454961,1350851717672992089,

%T 79766443076872509863361,4710128697246244834921603689,

%U 278128389443693511257285776231761,16423203268260658146231467800709255289,969773729787523602876821942164080815560161

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

%H Vincenzo Librandi, <a href="/A013853/b013853.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 (59049).

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

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

%o (PARI) a(n) = 9^(5*n+4); \\ _Altug Alkan_, Sep 08 2018

%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 09:18 EDT 2024. Contains 371935 sequences. (Running on oeis4.)