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!)
A013850 a(n) = 9^(5*n + 1). 1
9, 531441, 31381059609, 1853020188851841, 109418989131512359209, 6461081889226673298932241, 381520424476945831628649898809, 22528399544939174411840147874772641, 1330279464729113309844748891857449678409 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
From Wesley Ivan Hurt, Jan 02 2022: (Start)
G.f.: 9/(1-59049*x).
E.g.f.: 9*exp(59049*x).
a(n) = 59049*a(n-1).
a(n) = A001019(A016861(n)). (End)
MATHEMATICA
Table[9^(5 n + 1), {n, 0, 12}] (* Wesley Ivan Hurt, Jan 02 2022 *)
PROG
(Magma) [9^(5*n+1): n in [0..15]]; // Vincenzo Librandi, Jul 08 2011
(Maxima) makelist(9^(5*n+1), n, 0, 20); /* Martin Ettl, Oct 21 2012 */
(PARI) a(n) = 9^(5*n+1); \\ Altug Alkan, Sep 08 2018
CROSSREFS
Sequence in context: A225069 A058468 A133414 * A174001 A273234 A259159
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 24 13:18 EDT 2024. Contains 371952 sequences. (Running on oeis4.)