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

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

%S 23,279841,3404825447,41426511213649,504036361936467383,

%T 6132610415680998648961,74615470927590710561908487,

%U 907846434775996175406740561329,11045767571919545466173812409689943,134393854047545109686936775588697536481

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

%H Vincenzo Librandi, <a href="/A013772/b013772.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).

%F a(n) = 12167*a(n-1). - _Harvey P. Dale_, Aug 17 2016

%t 23^(3*Range[0,10]+1) (* or *) NestList[12167#&,23,10] (* _Harvey P. Dale_, Aug 17 2016 *)

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

%o (Maxima) makelist(23^(3*n+1),n,0,20); /* _Martin Ettl_, Oct 21 2012 */

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