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 A090617 #16 Jul 10 2022 16:10:41
%S A090617 0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,5,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,10,
%T A090617 10,10,10,11,11,11,11,12,12,13,13,13,13,14,14,15,15,15,15,16,16,16,16,
%U A090617 17,17,18,18,18,18,19,19,21,21,21,21,22,22,22,22,23,23,23,23,24,24,24,24
%N A090617 Exponent of highest power of 8 dividing n!.
%F A090617 a(n) = A090622(n, 8) = floor(A011371(n)/3) = floor((floor(n/2) + floor(n/4) + floor(n/8) + floor(n/16) + ...)/3).
%F A090617 a(n) = A244413(n!) . - _R. J. Mathar_, Jul 08 2021
%e A090617 a(8)=2 since 8! = 40320 = 8^2 * 630.
%t A090617 Table[IntegerExponent[n!,8],{n,0,80}] (* _Harvey P. Dale_, Mar 21 2013 *)
%o A090617 (Python 3.10+)
%o A090617 def A090617(n): return (n-bin(n).count('1'))//3 # _Chai Wah Wu_, Jul 09 2022
%o A090617 (PARI) a(n) = valuation(n!, 8); \\ _Michel Marcus_, Jul 10 2022
%Y A090617 Cf. A011371, A054861, A090616, A027868, A054896.
%K A090617 nonn
%O A090617 0,9
%A A090617 _Henry Bottomley_, Dec 06 2003