login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A249249
Total number of occurrences of the consecutive step pattern given by the binary expansion of n (where 1=up and 0=down) in all permutations of [n].
2
0, 0, 0, 1, 3, 50, 270, 840, 5376, 166320, 2903040, 20956320, 191600640, 4203239040, 29059430400, 119870150400, 1598268672000, 112634352230400, 4623936565248000, 61498356317798400, 1773991047628800000, 69256610499428352000, 1061556242901073920000
OFFSET
0,5
LINKS
FORMULA
a(n) = Sum_{k>0} k*A242783(n,k).
CROSSREFS
Cf. A242783.
Sequence in context: A356642 A012857 A246221 * A034201 A099346 A075184
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jan 12 2015
STATUS
approved