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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024255 a(0)=0, a(n) = n*E(2n-1) for n>=1, where E(n) = A000111(n) are the Euler (or up-down) numbers. 2
0, 1, 4, 48, 1088, 39680, 2122752, 156577792, 15230058496, 1888788086784, 290888851128320, 54466478584365056, 12185086638082228224, 3209979242472703787008, 983522422455215438430208 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Number of cyclically alternating permutations of length 2n. Example: a(2)=4 because we have 1324, 1423, 2314, and 2413 (3412 is alternating but not cyclically alternating).

REFERENCES

N. D. Elkies, On the sums Sum_{k = -infinity .. infinity} (4k+1)^(-n), Amer. Math. Monthly, 110 (No. 7, 2003), 561-573.

G. Kreweras, Les preordres totaux compatibles avec un ordre partiel. Math. Sci. Humaines No. 53 (1976), 5-30.

LINKS

N. D. Elkies, On the sums Sum((4k+1)^(-n),k,-inf,+inf)

FORMULA

a(n) = 2^(n-1)*(2^n-1)*|B_n|.

G.f.: tan(x)*x/2.

MAPLE

a := n -> (-1)^n*2^(2*n-1)*(1-2^(2*n))*bernoulli(2*n); [From Peter Luschny (peter(AT)luschny.de), Jun 08 2009]

MATHEMATICA

Tan[x]*x/2 (* Even Part *)

CROSSREFS

Cf. A009752.

Sequence in context: A138448 A071221 A198038 * A166231 A191952 A013145

Adjacent sequences:  A024252 A024253 A024254 * A024256 A024257 A024258

KEYWORD

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net)

EXTENSIONS

Edited by Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 01 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 06:20 EST 2012. Contains 205570 sequences.