cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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].

Original entry on oeis.org

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

Views

Author

Alois P. Heinz, Jan 12 2015

Keywords

Crossrefs

Cf. A242783.

Formula

a(n) = Sum_{k>0} k*A242783(n,k).