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!)
A364184 a(n) = (12*n)!*(2*n)!*(3*n/2)!/((6*n)!*(9*n/2)!*(4*n)!*n!). 0
1, 1408, 6374082, 32993443840, 180669266788650, 1020694137466257408, 5882199787281395215344, 34369110490167819009785856, 202857467914154836183288657770, 1206640354461153104738279049134080, 7221430962039777689508936047385667332 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
A295481, defined by A295481(n) = (24*n)!*(4*n)!*(3*n)! / ((12*n)!*(9*n)!*(8*n)!*(2*n)!), is one of the 52 sporadic integral factorial ratio sequences of height 1 found by V. I. Vasyunin (see Bober, Table 2, Entry 51). Here we are essentially considering the sequence {A295481(n/2) : n >= 0}. Fractional factorials are defined in terms of the gamma function; for example, (9*n/2)! := Gamma(1 + 9*n/2).
This sequence is only conjecturally an integer sequence.
Conjecture: the supercongruences a(n*p^r) == a(n*p^(r-1)) (mod p^(3*r)) hold for all primes p >= 5 and all positive integers n and r.
LINKS
J. W. Bober, Factorial ratios, hypergeometric series, and a family of step functions, arXiv:0709.1977 [math.NT], 2007; J. London Math. Soc., 79, Issue 2, (2009), 422-444.
FORMULA
a(n) ~ c^n * 1/sqrt(6*Pi*n), where c = (2^15)/(3^2) * sqrt(3).
a(n) = 49152*(12*n - 1)*(12*n - 5)*(12*n - 7)*(12*n - 11)*(12*n - 13)*(12*n - 17)*(12*n - 19)*(12*n - 23)/(n*(n - 1)*(9*n - 2)*(9*n - 4)*(9*n - 8)*(9*n - 10)*(9*n - 14)*(9*n - 16))*a(n-2) with a(0) = 1 and a(1) = 1408.
MAPLE
seq( simplify((12*n)!*(2*n)!*(3*n/2)!/((6*n)!*(9*n/2)!*(4*n)!*n!)), n = 0..15);
CROSSREFS
Sequence in context: A210786 A187957 A235906 * A204745 A204741 A237742
KEYWORD
nonn,easy
AUTHOR
Peter Bala, Jul 13 2023
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 25 06:02 EDT 2024. Contains 375422 sequences. (Running on oeis4.)