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.

Previous Showing 21-23 of 23 results.

A246228 Number of permutations of [n] with exactly eight (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=up and 0=down.

Original entry on oeis.org

9690, 0, 0, 0, 0, 0, 15555589905976050, 0, 0, 0, 0, 0, 705927677520644167681, 0, 0, 0, 44817466764068599693530434, 0, 0, 0, 0, 327785215140138748862828534217850944, 0, 3576951943897328654730413638351518560, 0, 0, 0
Offset: 15

Views

Author

Alois P. Heinz, Aug 19 2014

Keywords

Crossrefs

Column k=8 of A242783.

A246229 Number of permutations of [n] with exactly nine (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=up and 0=down.

Original entry on oeis.org

571, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3744763744425692221838464, 0, 0, 0, 0, 22782734075857073364773911020731544, 0, 0, 0, 0, 0, 2416100449345559771899241542815463200217246990336, 0, 0, 938240970212978118278669946671983079935585224737310
Offset: 15

Views

Author

Alois P. Heinz, Aug 19 2014

Keywords

Crossrefs

Column k=9 of A242783.

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).
Previous Showing 21-23 of 23 results.