The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A130319 Number n for which n!!/S(n) is integer, where S(n) is the sum of all odd numbers minor or equal to n, if n is odd, or the sum of all even numbers minor or equal to n, if n is even. 3
 1, 2, 6, 10, 14, 16, 17, 18, 22, 26, 28, 29, 30, 34, 38, 40, 41, 42, 46, 48, 49, 50, 52, 53, 54, 58, 62, 64, 65, 66, 68, 69, 70, 74, 76, 77, 78, 82, 86, 88, 89, 90, 94, 96, 97, 98, 100 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 0..10000 EXAMPLE 6 --> 6!! = 48; 6 + 4 + 2 = 12; 48/12 = 4. 17 --> 17!! = 34459425; 17 + 15 + 13 + 11 + 9 + 7 + 5 + 3 + 1 = 81; 34459425/81 = 425425. MAPLE P:=proc(n) local a, i, j, k, w; for i from 1 by 1 to n do k:=i; w:=i-2; while w>0 do k:=k*w; w:=w-2; od; j:=i; w:=i-2; while w>0 do j:=j+w; w:=w-2; od; a:=k/j; if trunc(a)=a then print(i) fi; od; end: P(100); MATHEMATICA r[n_] := If[OddQ[n], Range[1, n, 2], Range[2, n, 2]]; Select[Range[100], Divisible[Times @@ (x = r[#]), Plus @@ x] &] (* Jayanta Basu, Aug 12 2013 *) Select[Range[100], If[OddQ[#], Divisible[#!!, ((#+1)/2)^2], Divisible[#!!, (#(#+2))/4]]&] (* Harvey P. Dale, Nov 30 2016 *) CROSSREFS Cf. A108552, A000290, A005408, A130318. Sequence in context: A165562 A302796 A302797 * A336338 A191256 A067368 Adjacent sequences:  A130316 A130317 A130318 * A130320 A130321 A130322 KEYWORD easy,nonn AUTHOR Paolo P. Lava and Giorgio Balzarotti, May 23 2007 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 May 8 13:26 EDT 2021. Contains 343666 sequences. (Running on oeis4.)