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

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

%S 11,161051,2357947691,34522712143931,505447028499293771,

%T 7400249944258160101211,108347059433883722041830251,

%U 1586309297171491574414436704891,23225154419887808141001767796309131,340039485861577398992406882305761986971

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

%H Vincenzo Librandi, <a href="/A013794/b013794.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 (14641).

%t 11^(4*Range[0,10]+1) (* or *) NestList[14641#&,11,10] (* _Harvey P. Dale_, Oct 12 2015 *)

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

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