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 A195207 #23 Aug 02 2024 03:15:23
%S A195207 0,0,0,1,0,4,0,6,0,24,0,4,0,24,0,4,0,16,0,24,0,32,0,96,0,144,0,16,0,
%T A195207 64,0,144,0,40,0,128,0,160,0,16,0,96,0,96,0,32,0,128,0,96,0,48,0,128,
%U A195207 0,96,0,96,0,32,0
%N A195207 Number of even divisors of !n.
%C A195207 !n is a subfactorial number (A000166).
%C A195207 Property of this sequence : for n different of 3, the number of even divisors of !n seems even.
%C A195207 From _Robert Israel_, Jul 31 2024: (Start)
%C A195207 a(n) = 0 if n is even, a(n) = A000005(A000166(n)/2) if n is odd.
%C A195207 Since n - 1 | A000166(n), a(n) >= A000005((n-1)/2) for odd n. (End)
%H A195207 Amiram Eldar, <a href="/A195207/b195207.txt">Table of n, a(n) for n = 0..82</a>
%F A195207 a(n) = A183063(A000166(n)), for n != 1. - _Amiram Eldar_, Aug 02 2024
%e A195207 a(7) = 6 because the divisors of !7 = 1854 are {1, 2, 3, 6, 9, 18, 103, 206, 309, 618, 927, 1854} with 6 even divisors 2, 6, 18, 206, 618, 1854.
%p A195207 A166 := proc(n) option remember; (n-1)*(procname(n-1)+procname(n-2)); end:
%p A195207 A166(0):= 1: A166(1):= 0:
%p A195207 f:= proc(n) if n::even then 0 else numtheory:-tau(A166(n)/2) fi end proc:
%p A195207 map(f, [$0...60]); # _Robert Israel_, Jul 31 2024
%t A195207 f[n_] := Block[{d = Divisors[Subfactorial[n]]}, Count[EvenQ[d], True]]; Table[f[n], {n, 0, 60}]
%Y A195207 Cf. A000005, A000166, A183063, A195208, A195209, A195210.
%K A195207 nonn
%O A195207 0,6
%A A195207 _Michel Lagneau_, Sep 13 2011