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

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

%S 14641,2357947691,379749833583241,61159090448414546291,

%T 9849732675807611094711841,1586309297171491574414436704891,

%U 255476698618765889551019445759400441,41144777789250865278081232758997200423491

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

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

%p A013861:=n->11^(5*n+4): seq(A013861(n), n=0..10); # _Wesley Ivan Hurt_, May 02 2017

%t 11^(5Range[0,10]+4) (* _Harvey P. Dale_, Mar 21 2011 *)

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

%Y Cf. A001020 (11^n), A016897 (5*n+4).

%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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)