STATUS
editing
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A263748
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing all changes.
Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and every three consecutive elements having its maximum within 5 of its minimum
(history; published version)
(history; published version)
LINKS
R. H. Hardin, <a href="/A263748/b263748.txt">Table of n, a(n) for n = 1..220</a>
NAME
allocated for R. H. Hardin
Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and every three consecutive elements having its maximum within 5 of its minimum
DATA
1, 2, 6, 24, 120, 504, 930, 1794, 3852, 9246, 24613, 69414, 185540, 475520, 1173888, 2874864, 7141844, 18113441, 46245953, 118174785, 300561681, 759840542, 1915350786, 4833118568, 12216213910, 30929782130, 78368738162, 198501078760
OFFSET
1,2
COMMENTS
Column 4 of A263752
FORMULA
Empirical: a(n) = a(n-1) +2*a(n-2) +2*a(n-3) -3*a(n-5) +45*a(n-6) +32*a(n-7) +10*a(n-8) -40*a(n-9) -88*a(n-10) -147*a(n-11) -225*a(n-12) -180*a(n-13) -374*a(n-14) +266*a(n-15) +1041*a(n-16) +a(n-17) -198*a(n-18) +772*a(n-19) +1107*a(n-20) -901*a(n-21) -678*a(n-22) -392*a(n-23) -950*a(n-24) +135*a(n-25) +103*a(n-26) +1482*a(n-27) -1130*a(n-28) +278*a(n-29) +1712*a(n-30) -53*a(n-31) +133*a(n-32) +342*a(n-33) -628*a(n-34) -532*a(n-35) +1275*a(n-36) -891*a(n-37) -940*a(n-38) -422*a(n-39) +14*a(n-40) -52*a(n-41) -690*a(n-42) -38*a(n-43) +618*a(n-44) +328*a(n-45) +220*a(n-46) +200*a(n-47) -74*a(n-48) +250*a(n-49) -78*a(n-50) -128*a(n-51) -104*a(n-52) -152*a(n-53) +30*a(n-54) +20*a(n-55) -40*a(n-56) +30*a(n-57) +8*a(n-58) +2*a(n-59) +26*a(n-60) -4*a(n-61) -8*a(n-62) for n>74
EXAMPLE
Some solutions for n=10
..2....0....0....4....0....0....1....4....0....1....0....0....0....1....1....2
..1....1....1....2....1....1....3....0....1....2....1....1....4....4....0....3
..0....3....3....5....2....3....0....1....2....0....2....2....1....0....5....0
..3....2....2....0....3....2....5....5....3....4....3....6....2....2....2....1
..4....5....5....1....7....4....2....3....6....3....7....3....3....3....3....5
..8....4....4....3....6....5....6....2....8....8....5....5....6....5....4....6
..6....9....6....6....4....8....7....7....4....7....4....8....5....7....6....8
..5....7....9....7....5....6....4....6....9....9....9....7....9....8....9....9
..7....8....7....9....8....9....8....9....5....5....6....4....7....9....7....4
..9....6....8....8....9....7....9....8....7....6....8....9....8....6....8....7
CROSSREFS
Cf. A263752
KEYWORD
allocated
nonn
AUTHOR
R. H. Hardin, Oct 25 2015
STATUS
approved
editing
NAME
allocated for R. H. Hardin
KEYWORD
allocated
STATUS
approved