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!)
A034910 One quarter of octo-factorial numbers. 14

%I #60 Aug 05 2023 13:09:50

%S 1,12,240,6720,241920,10644480,553512960,33210777600,2258332876800,

%T 171633298636800,14417197085491200,1326382131865190400,

%U 132638213186519040000,14324927024144056320000,1661691534800710533120000,206049750315288106106880000

%N One quarter of octo-factorial numbers.

%C A034910 occurs in connection with the Vandermonde permanent of (1,3,5,7,9,...); see the Mathematica section of A203516. - _Clark Kimberling_, Jan 03 2012

%H G. C. Greubel, <a href="/A034910/b034910.txt">Table of n, a(n) for n = 1..325</a>

%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>.

%F 4*a(n) = (8*n-4)(!^8) = Product_{j=1..n} (8*j-4) = 4^n*A001147(n) = 2^n*(2*n)!/n!, A001147(n) = (2*n-1)!!.

%F E.g.f. (-1+(1-8*x)^(-1/2))/4.

%F a(n) = A090802(2n-1, n). - _Ross La Haye_, Oct 18 2005

%F a(n) = ((2*n)!/n!)*2^(n-2). - _Zerinvary Lajos_, Sep 25 2006

%F G.f.: x/(1-12*x/(1-8*x/(1-20*x/(1-16*x/(1-28*x/(1-24*x/(1-36*x/(1-32*x/(1-... (continued fraction). - _Philippe Deléham_, Jan 07 2011

%F From _Peter Bala_, Feb 01 2015: (Start)

%F Recurrence equation: a(n) = (7*n - 3)*a(n-1) + 4*(n - 1)*(2*n - 3)*a(n-2).

%F The sequence b(n) := a(n)* Sum_{k = 0..n-1} (-1)^k/( 2^k*(2*k + 1)*binomial(2*k,k) ) beginning [1, 11, 222, 6210, 223584, ...] satisfies the same recurrence. This leads to the finite continued fraction expansion b(n)/a(n) = 1/(1 + 1/(11 + 24/(18 + 60/(25 + ... + 4*(n - 1)*(2*n - 3)/(7*n - 3) )))) for n >= 3.

%F Letting n tend to infinity gives the continued fraction expansion Sum_{k>=0} (-1)^k/( 2^k*(2*k + 1)*binomial(2*k,k) ) = (4/3)*log(2) = 1/(1 + 1/(11 + 24/(18 + 60/(25 + ... + 4*(n - 1)*(2*n - 3)/((7*n - 3) + ... ))))). (End)

%F From _Peter Bala_, Feb 03 2015: (Start)

%F This sequence satisfies several other second order recurrence equations leading to some continued fraction expansions.

%F 1) a(n) = (9*n + 4)*a(n-1) - 4*n*(2*n - 1)*a(n-2).

%F This recurrence is also satisfied by the (integer) sequence c(n) := a(n)*Sum_{k = 0..n} 1/( 2^k*(2*k + 1)*binomial(2*k,k) ). From this we can obtain the continued fraction expansion Sum_{k >= 0} 1/( 2^k*(2*k + 1)*binomial(2*k,k) ) = (8/sqrt(7))*arctan(sqrt(7)/7) = (8/sqrt(7))*A195699 = 1 + 1/(12 - 24/(22 - 60/(31 - ... - 4*n*(2*n - 1)/((9*n + 4) - ... )))).

%F 2) a(n) = (12*n + 2)*a(n-1) - 8*(2*n - 1)^2*a(n-2).

%F This recurrence is also satisfied by the (integer) sequence d(n) := a(n)*Sum_{k = 0..n} 1/( (2*k + 1)*2^k ). From this we can obtain the continued fraction expansion Sum_{k >= 0} 1/( (2*k + 1)*2^k ) = (1/sqrt(2))*log(3 + 2*sqrt(2)) = 1 + 2/(12 - 8*3^2/(26 - 8*5^2/(38 - ... - 8*(2*n - 1)^2/((12*n + 2) - ... )))). Cf. A002391.

%F 3) a(n) = (4*n + 6)*a(n-1) + 8*(2*n - 1)^2*a(n-2).

%F This recurrence is also satisfied by the (integer) sequence e(n) := a(n)*Sum_{k = 0..n} (-1)^k/( (2*k + 1)*2^k ). From this we can obtain the continued fraction expansion Sum_{k >= 0} (-1)^k/( (2*k + 1)*2^k ) = (1/sqrt(2))*arctan(sqrt(2)/2) = 1 - 2/(12 + 8*3^2/(14 + 8*5^2/(18 + ... + 8*(2*n - 1)^2/((4*n + 6) + ... )))). Cf. A073000. (End)

%F a(n) = (-1)^n / (16*a(-n)) for all n in Z. - _Michael Somos_, Feb 04 2015

%F From _Amiram Eldar_, Jan 08 2022: (Start)

%F Sum_{n>=1} 1/a(n) = e^(1/8)*sqrt(2*Pi)*erf(1/(2*sqrt(2))), where erf is the error function.

%F Sum_{n>=1} (-1)^(n+1)/a(n) = e^(-1/8)*sqrt(2*Pi)*erfi(1/(2*sqrt(2))), where erfi is the imaginary error function. (End)

%e G.f. = x + 12*x^2 + 240*x^3 + 6720*x^4 + 241920*x^5 + 10644480*x^6 + ...

%p [seq((2*n)!/(n)!*2^(n-2), n=1..14)]; # _Zerinvary Lajos_, Sep 25 2006

%t s=1;lst={s};Do[s+=n*s;AppendTo[lst, s], {n, 11, 5!, 8}];lst (* _Vladimir Joseph Stephan Orlovsky_, Nov 08 2008 *)

%t a[ n_] := Pochhammer[ 1/2, n] 8^n / 4; (* _Michael Somos_, Feb 04 2015 *)

%o (PARI) {a(n) = if( n==1, 1, n>1, a(n-1) * (8*n - 4), a(n+1) / (8*n + 4))}; /* _Michael Somos_, Feb 04 2015 */

%o (Magma) [n le 2 select 12^(n-1) else (7*n-3)*Self(n-1) +4*(n-1)*(2*n-3)*Self(n-2): n in [1..30]]; // _G. C. Greubel_, Oct 20 2022

%o (SageMath) [2^(3*n-2)*rising_factorial(1/2, n) for n in range(1,40)] # _G. C. Greubel_, Oct 20 2022

%Y Cf. A001147, A045755, A034908, A034909, A034911, A034912, A203516.

%K easy,nonn

%O 1,2

%A _Wolfdieter Lang_

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 16 18:54 EDT 2024. Contains 375177 sequences. (Running on oeis4.)