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

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

%S 343,823543,1977326743,4747561509943,11398895185373143,

%T 27368747340080916343,65712362363534280139543,

%U 157775382034845806615042743,378818692265664781682717625943,909543680129861140820205019889143,2183814375991796599109312252753832343

%N a(n) = 7^(4*n + 3).

%H Vincenzo Librandi, <a href="/A013787/b013787.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 (2401).

%F From _Philippe Deléham_, Dec 02 2008: (Start)

%F a(n) = 2401*a(n-1); a(0)=343.

%F G.f.: 343/(1-2401*x).

%F a(n) = 49*A013786(n). (End)

%t 7^(4*Range[0,10]+3) (* or *) NestList[2401#&,343,10] (* _Harvey P. Dale_, Sep 09 2021 *)

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

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

%o (PARI) a(n)=7^(4*n+3) \\ _Charles R Greathouse IV_, Jul 11 2016

%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 16 09:52 EDT 2024. Contains 371698 sequences. (Running on oeis4.)