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
289, 1419857, 6975757441, 34271896307633, 168377826559400929, 827240261886336764177, 4064231406647572522401601, 19967568900859523802559065713, 98100666009922840441972689847969, 481968572106750915091411825223071697 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
From Philippe Deléham, Dec 03 2008: (Start)
a(n) = 4913*a(n-1), a(0)=289.
G.f.: 289/(1-4913*x).
a(n) = 17*A013760(n). (End)
PROG
(Magma) [17^(3*n+2): n in [0..15]]; // Vincenzo Librandi, May 24 2011
(PARI) a(n)=17^(3*n+2) \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
Sequence in context: A260866 A252360 A125249 * A013883 A180701 A091680
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)