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

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

%S 14,7529536,4049565169664,2177953337809371136,

%T 1171355575953987221848064,629983141281877223603213172736,

%U 338820052976784335907174521413566464,182225556172186058674940229804729969934336,98005277522749794820791054154499091349964324864

%N a(n) = 14^(5*n + 1).

%H Vincenzo Librandi, <a href="/A013870/b013870.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 (537824).

%t 14^(5*Range[0,10]+1) (* or *) NestList[537824#&,14,10] (* _Harvey P. Dale_, Jun 26 2017 *)

%o (Magma) [14^(5*n+1): n in [0..10]]; // _Vincenzo Librandi_, Jul 09 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 May 9 18:53 EDT 2024. Contains 372354 sequences. (Running on oeis4.)