OFFSET
0,3
LINKS
T. D. Noe, Table of n, a(n) for n=0..300
Joseph E. Cooper III, A recurrence for an expression involving double factorials, arXiv:1510.00399 [math.CO], 2015.
Svante Janson, On the traveling fly problem, Graph Theory Notes of New York Vol. XXXI, 17, 1996.
FORMULA
Let y(m) = y(m-2) + 1/y(m-1) for m >= 2, with y(0)=y(1)=1. Then the denominator of y(n+1) equals the numerator of n!!/(n+1)!! for n >= 0, where the double factorials are given by A006882. [Reinhard Zumkeller, Dec 08 2011, as corrected in Cooper (2015)]
MATHEMATICA
Numerator[#[[1]]/#[[2]]&/@Partition[Range[0, 40]!!, 2, 1]] (* Harvey P. Dale, Jan 22 2013 *)
Numerator[CoefficientList[Series[(1 - Sqrt[1 - c^2] + ArcSin[c])/(c Sqrt[1 - c^2]), {c, 0, 39}], c]] (* Eugene d'Eon, Nov 01 2018 *)
PROG
(Haskell)
import Data.Ratio ((%), denominator)
a004730 n = a004730_list !! n
a004730_list = map denominator ggs where
ggs = 1 : 2 : zipWith (+) ggs (map (1 /) $ tail ggs) :: [Rational]
-- Reinhard Zumkeller, Dec 08 2011
(Magma) DoubleFactorial:=func< n | &*[n..2 by -2] >; [ Numerator(DoubleFactorial(n) / DoubleFactorial(n+1)): n in [0..35]]; // Vincenzo Librandi, Dec 03 2018
(Python)
from sympy import gcd, factorial2
def A004730(n):
a, b = factorial2(n), factorial2(n+1)
return a//gcd(a, b) # Chai Wah Wu, Apr 03 2021
CROSSREFS
KEYWORD
nonn,frac
AUTHOR
STATUS
approved