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

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

%S 529,6436343,78310985281,952809757913927,11592836324538749809,

%T 141050039560662968926103,1716155831334586342923895201,

%U 20880467999847912034355032910567,254052654154149545721997685422868689

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

%H Vincenzo Librandi, <a href="/A013773/b013773.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 (12167).

%t 23^(3*Range[0,20]+2) (* or *) NestList[12167#&,529,20] (* _Harvey P. Dale_, Nov 22 2021 *)

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

%Y Subsequence of A009967.

%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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)