|
%I #13 Jan 05 2024 02:55:19
%S 1,1,2,1,1,2,1,1,2,1,1,3,1,1,2,1,1,2,1,1,2,1,1,3,1,1,2,1,1,2,1,1,2,1,
%T 1,3,1,1,2,1,1,2,1,1,2,1,1,3,1,1,2,1,1,2,1,1,2,1,1,4,1,1,2,1,1,2,1,1,
%U 2,1,1,3,1,1,2,1,1,2,1,1,2,1,1,3,1,1
%N a(n) = the largest k such that (k+1)! divides 2n; the number of trailing zeros in the factorial base representation of even numbers.
%H Antti Karttunen, <a href="/A230404/b230404.txt">Table of n, a(n) for n = 1..10080</a>
%F a(n) = A230403(2n) = A055881(2n) - 1.
%F Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2*e - 4 = A019762 - 4 = 1.436563... . - _Amiram Eldar_, Jan 05 2024
%o (Scheme)
%o (define (A230404 n) (A230403 (* 2 n)))
%Y Used to compute A230405 and A219650. See A007623 for factorial base representation.
%Y Analogous sequence for binary system: A001511.
%Y Cf. A019762.
%K nonn,easy
%O 1,3
%A _Antti Karttunen_, Oct 31 2013
|
