The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A205089

Number of (n+1)X(n+1) 0..3 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal and vertical neighbors
(history; published version)

#6 by Russ Cox at Sat Mar 31 12:37:04 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Jan 22 2012

Discussion

Sat Mar 31

12:37

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

#5 by Ron Hardin at Sun Jan 22 04:59:53 EST 2012

STATUS

editing

approved

#4 by Ron Hardin at Sun Jan 22 04:59:48 EST 2012

LINKS

R. H. Hardin, <a href="/A205089/b205089.txt">Table of n, a(n) for n = 1..10</a>

#3 by Ron Hardin at Sun Jan 22 04:59:20 EST 2012

NAME

allocated for Ron HardinNumber of (n+1)X(n+1) 0..3 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal and vertical neighbors

DATA

256, 13116, 4251766, 6997750028, 56016870922512, 2198408614173601972, 426069670428664499911552, 408397032103596887991434131888, 1937279907224716538436705741462507484

OFFSET

1,1

COMMENTS

Diagonal of A205097

EXAMPLE

Some solutions for n=4

..3..1..2..0..1....1..3..3..1..0....2..2..3..0..3....1..1..0..2..1

..2..3..2..3..0....0..0..3..3..0....0..3..1..2..2....0..3..1..0..2

..3..1..3..0..2....1..0..0..1..1....3..2..3..0..3....2..1..2..2..0

..0..3..0..3..2....1..1..0..0..1....2..3..0..3..2....0..3..0..3..2

..1..0..1..1..3....3..1..1..0..0....3..0..3..1..3....1..0..1..1..3

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Jan 22 2012

STATUS

approved

editing

#2 by Ron Hardin at Sun Jan 22 04:57:27 EST 2012

KEYWORD

allocating

allocated

#1 by Ron Hardin at Sun Jan 22 04:57:27 EST 2012

NAME

allocated for Ron Hardin

KEYWORD

allocating

STATUS

approved