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

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

%S 289,1419857,6975757441,34271896307633,168377826559400929,

%T 827240261886336764177,4064231406647572522401601,

%U 19967568900859523802559065713,98100666009922840441972689847969,481968572106750915091411825223071697

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

%H Vincenzo Librandi, <a href="/A013761/b013761.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 (4913).

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

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

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

%F a(n) = 17*A013760(n). (End)

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

%o (PARI) a(n)=17^(3*n+2) \\ _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 27 13:50 EDT 2024. Contains 372019 sequences. (Running on oeis4.)