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!)
A099753 a(n) = (2*n+1)^(n+2). 4
1, 27, 625, 16807, 531441, 19487171, 815730721, 38443359375, 2015993900449, 116490258898219, 7355827511386641, 504036361936467383, 37252902984619140625, 2954312706550833698643, 250246473680347348787521, 22550116774162743178682911, 2154025884392726618070214209 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
From Peter Bala, Aug 06 2012: (Start)
E.g.f.: d^2/dx^2{(2*x/T(2*x))^(3/2)*1/(1 - T(2*x))} = 1 + 27*x + 625*x^2/2! + ..., where T(x) is the tree function sum {n >=1} n^(n-1)*x^n/n! of A000169.
For r = 0, 1, 2, ..., the e.g.f. for the sequence (2*n+1)^(n+r) can be expressed in terms of the function U(z) = sum {n >= 0} (2*n+1)^(n-1)*z^(2*n+1)/(2^n*n!). See A214406 for details. In the present case, r = 2, and the resulting e.g.f. is 1/z*U(z)*(1 + 8*U(z)^2 + 3*U(z)^4)/(1 - U(z)^2)^5 taken at z = sqrt(2*x).
(End)
MAPLE
seq((2*n+1)^(n+2), n=0..30); # G. C. Greubel, Sep 03 2019
MATHEMATICA
Table[(2*n+1)^(n+2), {n, 0, 30}] (* G. C. Greubel, Sep 03 2019 *)
PROG
(PARI) vector(30, n, (2*n-1)^(n+1)) \\ G. C. Greubel, Sep 03 2019
(Magma) [(2*n+1)^(n+2): n in [0..30]]; // G. C. Greubel, Sep 03 2019
(Sage) [(2*n+1)^(n+2) for n in (0..30)] # G. C. Greubel, Sep 03 2019
(GAP) List([0..30], n-> (2*n+1)^(n+2)); # G. C. Greubel, Sep 03 2019
CROSSREFS
Sequence in context: A185891 A185883 A212670 * A231292 A046359 A223500
KEYWORD
nonn,easy
AUTHOR
Kari Lajunen (Kari.Lajunen(AT)Welho.com), Nov 11 2004
EXTENSIONS
Terms a(13) onward added by G. C. Greubel, Sep 03 2019
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 26 16:30 EDT 2024. Contains 372003 sequences. (Running on oeis4.)