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

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

%S 121,19487171,3138428376721,505447028499293771,

%T 81402749386839761113321,13109994191499930367061460371,

%U 2111377674535255285545615254209921,340039485861577398992406882305761986971,54763699237492901685126120802225273763666521

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

%H Vincenzo Librandi, <a href="/A013859/b013859.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 (161051).

%t NestList[161051#&,121,10] (* _Harvey P. Dale_, May 23 2018 *)

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

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

%o (PARI) a(n) = 11^(5*n+2); \\ _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 March 19 06:29 EDT 2024. Contains 370953 sequences. (Running on oeis4.)