The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A180154

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Number of permutations of 0..(n-1) with the sum of the maximum of each adjacent pair = n*(n-1)/2 + floor((n-1)^2/8)
(history; published version)

#3 by Russ Cox at Sat Mar 31 12:35:45 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net), _, Aug 13 2010

Discussion

Sat Mar 31

12:35

OEIS Server: https://oeis.org/edit/global/875

#2 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010

KEYWORD

nonn,new

nonn

AUTHOR

Ron R. H. Hardin (rhhardin(AT)att.net), Aug 13 2010

#1 by N. J. A. Sloane at Fri Aug 27 03:00:00 EDT 2010

NAME

Number of permutations of 0..(n-1) with the sum of the maximum of each adjacent pair = n*(n-1)/2 + floor((n-1)^2/8)

DATA

2, 4, 8, 36, 160, 848, 5792, 41712, 338688, 2902464, 30968064, 346316544, 4034119680, 48892557312, 707976364032

OFFSET

2,1

KEYWORD

nonn,new

AUTHOR

Ron Hardin (rhhardin(AT)att.net), Aug 13 2010

STATUS

approved