OFFSET
1,3
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Peter Luschny, On the prime factors of the swinging factorial.
MAPLE
SwingExp := proc(m, n) local p, q; p := m;
do q := iquo(n, p);
if (q mod 2) = 1 then RETURN(1) fi;
if q = 0 then RETURN(0) fi;
p := p * m;
od end:
Search := proc(n, L) local m, i, r; m := n;
for i in L do r := SwingExp(i, m);
if r <> 0 then RETURN(NULL) fi
od; n end:
A196747_list := n -> Search(n, [3]): # n is a search limit
MATHEMATICA
(* A naive solution *) sf[n_] := n!/Quotient[n, 2]!^2; Select[Range[0, 600], ! Divisible[sf[#], 3] &] (* Jean-François Alcover, Jun 28 2013 *)
PROG
(PARI) valp(n, p)=my(s); while(n\=p, s+=n); s
is(n)=my(t=valp(n, 3)); t%2==0 && 2*valp(n\2, 3)==t \\ Charles R Greathouse IV, Feb 02 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Oct 06 2011
STATUS
approved