This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A055656 #18 Jul 15 2024 10:23:56
%S A055656 0,-1,0,0,2,2,3,3,3,3,4,4,6,6,6,6,10,10,11,11,11,11,12,12,12,12,12,12,
%T A055656 14,14,15,15,15,15,15,15,17,17,17,17,20,20,21,21,21,21,22,22,22,22,22,
%U A055656 22,24,24,24,24,24,24,25,25,27,27,27,27,27,27,28,28,28,28,29,29,32,32
%N A055656 Excess in exponents of powers of 2 in Euler phi of n! compared to that of n!.
%C A055656 The exponents of 2 is larger in phi(n!) than in n! if n > 4.
%H A055656 Amiram Eldar, <a href="/A055656/b055656.txt">Table of n, a(n) for n = 1..10000</a>
%F A055656 a(n) = A007814(A048855(n))-A007814(n!) = A007814(A048855(n))-A011371(A000142(n)).
%e A055656 For n = 8, 8! = 40320 = 128*315, phi(40320) = 9216 = 9*1024. The exponent of 2 in 8! is only 7, and in phi(8!) it is 10, so a(8) = 10-7 = 3.
%t A055656 eep2[n_]:=Module[{f=n!},IntegerExponent[EulerPhi[f],2]-IntegerExponent[f,2]]; Array[ eep2,80] (* _Harvey P. Dale_, Mar 18 2023 *)
%o A055656 (Python)
%o A055656 from math import factorial, prod
%o A055656 from sympy import primerange
%o A055656 from fractions import Fraction
%o A055656 def A055656(n): return (~(m:=((f:=factorial(n))*prod(Fraction(p-1,p) for p in primerange(n+1))).numerator)&m-1).bit_length()-(~f & f-1).bit_length() # _Chai Wah Wu_, Jul 06 2022
%o A055656 (PARI) a(n) = {my(f = n!); valuation(eulerphi(f), 2) - valuation(f, 2);} \\ _Amiram Eldar_, Jul 15 2024
%Y A055656 Cf. A000142, A000010, A048855, A007814, A011371.
%K A055656 sign
%O A055656 1,5
%A A055656 _Labos Elemer_, Jul 11 2000