The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A263681

Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and with no two consecutive decreases.
(history; published version)

#4 by R. H. Hardin at Fri Oct 23 14:15:32 EDT 2015

STATUS

editing

approved

#3 by R. H. Hardin at Fri Oct 23 14:15:29 EDT 2015

LINKS

R. H. Hardin, <a href="/A263681/b263681.txt">Table of n, a(n) for n = 1..210</a>

#2 by R. H. Hardin at Fri Oct 23 14:15:14 EDT 2015

NAME

allocated for R. H. Hardin

Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and with no two consecutive decreases.

DATA

1, 2, 5, 17, 70, 349, 2017, 11253, 58743, 286327, 1331630, 6077344, 27523597, 126333667, 587717372, 2760990038, 13033515692, 61583867944, 290639649211, 1368090247852, 6426462715392, 30151737816899, 141417395713905

OFFSET

1,2

COMMENTS

Column 6 of A263683.

EXAMPLE

Some solutions for n=7

..1....4....1....3....3....2....1....2....0....0....5....0....0....3....2....2

..0....5....6....6....5....6....0....5....5....2....6....1....1....1....6....0

..5....0....4....0....6....1....3....0....1....5....1....3....6....5....3....1

..6....1....5....2....0....4....2....1....4....6....3....4....4....0....5....6

..2....6....2....4....1....3....4....3....6....3....0....6....5....6....1....3

..3....2....3....1....2....5....5....4....2....4....2....2....2....2....4....4

..4....3....0....5....4....0....6....6....3....1....4....5....3....4....0....5

CROSSREFS

Cf. A263683.

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Oct 23 2015

STATUS

approved

editing

#1 by R. H. Hardin at Fri Oct 23 14:11:23 EDT 2015

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved