Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A327021 a(n) = (2*n-1)! / 2^(n-1) if n > 0 and a(0) = 1. 2
1, 1, 3, 30, 630, 22680, 1247400, 97297200, 10216206000, 1389404016000, 237588086736000, 49893498214560000, 12623055048283680000, 3786916514485104000000, 1329207696584271504000000, 539658324813214230624000000, 250941121038144617240160000000, 132496911908140357902804480000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
A shifted version of A007019.
LINKS
FORMULA
a(n) = ((2*(n-2)^3 + (n-2)^2)*a(n-2) + (2*(n-2)^3 + 9*(n-2)^2 + 12*n-18)*a(n-1))/n for n >= 2.
MAPLE
A327021 := n -> `if`(n = 0, 1, (2*n-1)! / 2^(n-1)): seq(A327021(n), n = 0..17);
# Alternative:
a := proc(n) option remember; if n < 2 then return 1 fi;
((2*(n-2)^3 + (n-2)^2)*a(n-2) + (2*(n-2)^3 + 9*(n-2)^2 + 12*n-18)*a(n-1))/n end:
CROSSREFS
Cf. A007019.
Sequence in context: A274797 A092677 A007019 * A186941 A082879 A012007
KEYWORD
nonn
AUTHOR
Peter Luschny, Aug 20 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 August 20 14:16 EDT 2024. Contains 375336 sequences. (Running on oeis4.)