login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..130

FORMULA

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

CROSSREFS

Cf. A242783.

Sequence in context: A309869 A012857 A246221 * A034201 A099346 A075184

Adjacent sequences:  A249246 A249247 A249248 * A249250 A249251 A249252

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jan 12 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 11:46 EDT 2021. Contains 343971 sequences. (Running on oeis4.)