The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A209375

1/4 the number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having distinct edge sums
(history; published version)

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

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Mar 07 2012

Discussion

Sat Mar 31

12:37

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

#5 by Ron Hardin at Wed Mar 07 05:28:27 EST 2012

STATUS

editing

approved

#4 by Ron Hardin at Wed Mar 07 05:28:23 EST 2012

LINKS

R. H. Hardin, <a href="/A209375/b209375.txt">Table of n, a(n) for n = 1..17</a>

#3 by Ron Hardin at Wed Mar 07 05:28:03 EST 2012

NAME

allocated for Ron Hardin1/4 the number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having distinct edge sums

DATA

4, 17, 64, 512, 2176, 52784, 242176, 22205984, 103942144, 39954751040, 183158185984, 304199179800704, 1345426301157376, 9591893861120254208, 41024530124682428416, 1232880451618561434845696

OFFSET

1,1

COMMENTS

Diagonal of A209382

EXAMPLE

Some solutions for n=4

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

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

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

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

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

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Mar 07 2012

STATUS

approved

editing

#2 by Ron Hardin at Wed Mar 07 05:22:08 EST 2012

KEYWORD

allocating

allocated

#1 by Ron Hardin at Wed Mar 07 05:22:08 EST 2012

NAME

allocated for Ron Hardin

KEYWORD

allocating

STATUS

approved