This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A196747 Numbers n such that 3 does not divide swing(n) = A056040(n). 4
 0, 1, 2, 6, 7, 8, 18, 19, 20, 24, 25, 26, 54, 55, 56, 60, 61, 62, 72, 73, 74, 78, 79, 80, 162, 163, 164, 168, 169, 170, 180, 181, 182, 186, 187, 188, 216, 217, 218, 222, 223, 224, 234, 235, 236, 240, 241, 242, 486, 487, 488, 492, 493, 494, 504, 505, 506, 510 (list; graph; refs; listen; history; text; internal format)
 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 Cf. A005836, A129508, A030979, A151750, A196748, A196749, A196750. Sequence in context: A165775 A258826 A157671 * A261691 A296443 A102046 Adjacent sequences:  A196744 A196745 A196746 * A196748 A196749 A196750 KEYWORD nonn AUTHOR Peter Luschny, Oct 06 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 19 15:24 EDT 2019. Contains 327198 sequences. (Running on oeis4.)