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!)
A338375 Number of digits in (2n)! / (2^n * n!). 1
1, 1, 2, 3, 3, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 18, 19, 21, 22, 24, 26, 27, 29, 31, 32, 34, 36, 37, 39, 41, 43, 45, 46, 48, 50, 52, 54, 56, 58, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 104, 106, 108, 110 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
a(n) is the number of digits in double factorial of odd numbers (see A001147).
LINKS
FORMULA
a(n) = floor(log((2n)!/((2^n)*n!))/log(10))+1.
a(n) = A055642(A001147(n)).
EXAMPLE
For n = 7, (2*n-1)!! = 13!! = 135135 and the number of digits is 6.
MAPLE
seq(1 + ilog10(doublefactorial(2*n-1)), n=1..100); # Robert Israel, Jan 15 2024
MATHEMATICA
a[n_] := IntegerLength[(2 n - 1)!!]; Array[a, 65] (* Amiram Eldar, Oct 23 2020 *)
PROG
(Sage) floor((log(factorial(2 * n) / ((2 ** n) * factorial(n))) / log(10))) + 1
CROSSREFS
Sequence in context: A070321 A239904 A334819 * A220838 A236294 A251419
KEYWORD
nonn,base
AUTHOR
Jeremias M. Gomes, Oct 23 2020
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 12 10:46 EDT 2024. Contains 375092 sequences. (Running on oeis4.)