|
| |
|
|
A163590
|
|
Odd part of the swinging factorial A056040.
|
|
2
| |
|
|
1, 1, 1, 3, 3, 15, 5, 35, 35, 315, 63, 693, 231, 3003, 429, 6435, 6435, 109395, 12155, 230945, 46189, 969969, 88179, 2028117, 676039, 16900975, 1300075, 35102025, 5014575, 145422675, 9694845, 300540195
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| Let n$ denote the swinging factorial. a(n) = n$ / 2^sigma(n) where sigma(n) is the exponent of 2 in the prime-factorisation of n$. sigma(n) can be computed as the number of '1's in the base 2 representation of floor(n/2).
|
|
|
REFERENCES
| Peter Luschny, "Divide, swing and conquer the factorial and the lcm{1,2,...,n}", preprint, April 2008.
|
|
|
LINKS
| Peter Luschny, Swinging Factorial.
|
|
|
EXAMPLE
| 11$ = 2772 = 2^2*3^2*7*11. Therefore a(11) = 3^2*7*11 = 2772/4 = 693.
|
|
|
MAPLE
| swing := proc(n) option remember; if n = 0 then 1 elif irem(n, 2) = 1 then swing(n-1)*n else 4*swing(n-1)/n fi end:
sigma := n -> 2^(add(i, i= convert(iquo(n, 2), base, 2))):
a := n -> swing(n)/sigma(n);
|
|
|
CROSSREFS
| Cf. A056040 and A060632. A001790 = a(2*n), A001803(n) = a(2*n+1).
Sequence in context: A100347 A165405 A179857 * A114320 A160612 A172087
Adjacent sequences: A163587 A163588 A163589 * A163591 A163592 A163593
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Peter Luschny (peter(AT)luschny.de), Aug 01 2009
|
| |
|
|
