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

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

%S 17,4913,1419857,410338673,118587876497,34271896307633,

%T 9904578032905937,2862423051509815793,827240261886336764177,

%U 239072435685151324847153,69091933913008732880827217

%N a(n) = 17^(2*n + 1).

%C Sum_{n>=0} 1/a(n) = 17/288. - _Jaume Oliver Lafont_, Feb 04 2009

%H Vincenzo Librandi, <a href="/A013722/b013722.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 (289).

%F From _Philippe Deléham_, Nov 28 2008: (Start)

%F a(n) = 289*a(n-1), a(0)=17.

%F G.f.: 17/(1-289*x). (End)

%p seq(17^(2*n+1),n=0..10); # _Nathaniel Johnston_, Jun 25 2011

%t 17^(2*Range[0,10]+1) (* or *) NestList[289#&,17,10] (* _Harvey P. Dale_, Aug 15 2012 *)

%o (Magma) [17^(2*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011

%o (PARI) a(n)=17^(2*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016

%Y Bisection of A001026 (17^n).

%Y Cf. A013708-A013721, A013723-A013729.

%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 25 10:22 EDT 2024. Contains 371967 sequences. (Running on oeis4.)