login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A338375 Number of digits in (2n)! / (2^n * n!). 0
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

Table of n, a(n) for n=1..65.

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.

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

Cf. A001147, A055642, A068398.

Sequence in context: A070321 A239904 A334819 * A220838 A236294 A251419

Adjacent sequences:  A338372 A338373 A338374 * A338376 A338377 A338378

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 8 08:16 EST 2021. Contains 341942 sequences. (Running on oeis4.)