The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A373752 a(n) = Sum_{k=0..n-2} A205497(n, k) * (1 - k mod 2) if n >= 2, a(0) = a(1) = 1. 1
 1, 1, 1, 1, 2, 8, 33, 136, 670, 3968, 25593, 176896, 1344154, 11184128, 99897361, 951878656, 9687175862, 104932671488, 1202872541673, 14544442556416, 185158504589938, 2475749026562048, 34676498435503489, 507711943253426176, 7757079744889072462, 123460740095103991808 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS Number of linear extensions in L(eps Z_n) that have an even number of descents. (See Petersen and Yan Zhuang, p. 6.) LINKS Table of n, a(n) for n=0..25. T. Kyle Petersen and Yan Zhuang, Zig-zag Eulerian polynomials, arXiv:2403.07181 [math.CO], 2024. FORMULA a + A373753 = A000111. MAPLE enum := L -> ListTools:-Enumerate(L): seq(add(c[2]*irem(c[1], 2), c = enum([A205497row(n)])), n = 0..25); CROSSREFS Cf. A205497, A000111, A373753. Sequence in context: A294530 A037513 A037716 * A279014 A099015 A150865 Adjacent sequences: A373749 A373750 A373751 * A373753 A373754 A373755 KEYWORD nonn AUTHOR Peter Luschny, Jun 16 2024 STATUS approved

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

Last modified September 12 11:34 EDT 2024. Contains 375851 sequences. (Running on oeis4.)