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

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

%S 23,12167,6436343,3404825447,1801152661463,952809757913927,

%T 504036361936467383,266635235464391245607,141050039560662968926103,

%U 74615470927590710561908487,39471584120695485887249589623

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

%H Vincenzo Librandi, <a href="/A013728/b013728.txt">Table of n, a(n) for n = 0..200</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 (529).

%F From _Philippe Deléham_, Nov 28 2008: (Start)

%F a(n) = 529*a(n-1); a(0)=23.

%F G.f.: 23/(1-529*x). (End)

%p seq(23^(2*n+1),n=0..10); # _Nathaniel Johnston_, Jun 26 2011

%t NestList[529#&,23,15] (* _Harvey P. Dale_, Jan 17 2012 *)

%o (Magma) [23^(2*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011

%o (PARI) a(n)=23^(2*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016

%Y Cf. A013708-A013727, A013729.

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