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!)
A013756 a(n) = 15^(3*n + 1). 1
15, 50625, 170859375, 576650390625, 1946195068359375, 6568408355712890625, 22168378200531005859375, 74818276426792144775390625, 252511682940423488616943359375, 852226929923929274082183837890625, 2876265888493261300027370452880859375 (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) = 3375*a(n-1); a(0)=15
G.f.: 15/(1-3375*x). (End)
MATHEMATICA
Table[15^(3n+1), {n, 0, 10}] (* or *) NestList[3375#&, 15, 10] (* Harvey P. Dale, Sep 06 2023 *)
PROG
(Magma) [15^(3*n+1): n in [0..15]]; // Vincenzo Librandi, Jun 27 2011
(PARI) a(n)=15^(3*n+1) \\ Charles R Greathouse IV, Jul 10 2016
CROSSREFS
Subsequence of A001024.
Sequence in context: A104682 A185902 A358676 * A078185 A096224 A129613
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 April 25 13:36 EDT 2024. Contains 371970 sequences. (Running on oeis4.)