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

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

%S 529,3404825447,21914624432020321,141050039560662968926103,

%T 907846434775996175406740561329,5843211045545439551605946764725979847,

%U 37608910510519071039902074217516707306379521,242063847902005849254176436075394136454464685331703

%N a(n) = 23^(5*n + 2).

%H Vincenzo Librandi, <a href="/A013907/b013907.txt">Table of n, a(n) for n = 0..50</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 (6436343).

%F a(n) = 6436343*a(n-1), a(0)=529. - _Vincenzo Librandi_, May 29 2011

%F E.g.f.: 529*exp(6436343*x). - _Alejandro J. Becerra Jr._, Jun 27 2021

%t 23^(5*Range[0,10]+2) (* or *) NestList[6436343#&,529,10] (* _Harvey P. Dale_, Aug 17 2017 *)

%o (Magma) [23^(5*n+2): n in [0..10]]; // _Vincenzo Librandi_, May 29 2011

%Y Cf. A009967.

%K nonn

%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 March 18 21:02 EDT 2024. Contains 370951 sequences. (Running on oeis4.)