login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A327493 a(n) = 2^A327492(n). 6
1, 4, 8, 32, 128, 512, 1024, 4096, 32768, 131072, 262144, 1048576, 4194304, 16777216, 33554432, 134217728, 2147483648, 8589934592, 17179869184, 68719476736, 274877906944, 1099511627776, 2199023255552, 8796093022208, 70368744177664, 281474976710656, 562949953421312 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..26.

FORMULA

a(n) = denominator(b(n)) where b(n) = n!/(2^n*floor(n/2)!)^2 is the normalized swinging factorial (A056040).

MAPLE

A327493 := n -> 2^(A327492_list(n+1)[n+1]):

seq(A327493(n), n = 0..26);

PROG

(PARI) seq(n)={my(a=vector(n+1)); a[1]=1; for(n=1, n, a[n+1] = a[n] * 2^if(n%4, n%2 + 1, valuation(n, 2))); a} \\ Andrew Howroyd, Sep 28 2019

(PARI) a(n)={ denominator(sum(j=0, n, j!/(2^j*(j\2)!)^2)) } \\ Andrew Howroyd, Sep 28 2019

(Julia)

bitcount(n) = sum(digits(n, base = 2))

A327493(n) = 2^(2n - bitcount(n) + mod(n, 2))

[A327493(n) for n in 0:26] |> println # Peter Luschny, Oct 03 2019

CROSSREFS

Cf. A327492, A327491, A327494, A327495, A056040.

Sequence in context: A247473 A113479 A252540 * A103970 A227295 A034785

Adjacent sequences:  A327490 A327491 A327492 * A327494 A327495 A327496

KEYWORD

nonn

AUTHOR

Peter Luschny, Sep 27 2019

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 10:50 EST 2019. Contains 329093 sequences. (Running on oeis4.)