The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A189651

Number of 3Xn array permutations with each element moving zero or one space horizontally, diagonally or antidiagonally
(history; published version)

#5 by Russ Cox at Sat Mar 31 12:36:16 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Apr 24 2011

Discussion

Sat Mar 31

12:36

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

#4 by Ron Hardin at Sun Apr 24 16:23:38 EDT 2011

STATUS

proposed

approved

#3 by Ron Hardin at Sun Apr 24 16:23:34 EDT 2011

LINKS

R. H. Hardin, <a href="/A189651/b189651.txt">Table of n, a(n) for n = 1..200</a>

#2 by Ron Hardin at Sun Apr 24 16:23:12 EDT 2011

NAME

allocated for Ron HardinNumber of 3Xn array permutations with each element moving zero or one space horizontally, diagonally or antidiagonally

DATA

1, 32, 263, 4277, 55440, 799069, 11047585, 155610272, 2174615543, 30495310793, 427003730560, 5982947971505, 83805935210153, 1174054970088496, 16446690057231391, 230398085842470229, 3227563109360717136

OFFSET

1,2

COMMENTS

Row 3 of A189650

FORMULA

Empirical: a(n) = 10*a(n-1) +75*a(n-2) -240*a(n-3) -399*a(n-4) +972*a(n-5) -1263*a(n-6) +482*a(n-7) +669*a(n-8) -100*a(n-9) -9*a(n-10)

EXAMPLE

Some solutions for 3X3

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

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

..7..6..8....4..7..8....6..5..8....7..3..8....7..6..8....7..6..8....6..3..8

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Apr 24 2011

STATUS

approved

proposed

#1 by Ron Hardin at Sun Apr 24 16:10:38 EDT 2011

NAME

allocated for Ron Hardin

KEYWORD

allocated

STATUS

approved