The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A210331

1/4 the number of (n+1)X5 0..3 arrays with every 2X2 subblock having two or three distinct clockwise edge differences
(history; published version)

#5 by Russ Cox at Sat Mar 31 12:37:33 EDT 2012

AUTHOR

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

Discussion

Sat Mar 31

12:37

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

#4 by Ron Hardin at Tue Mar 20 08:56:13 EDT 2012

STATUS

editing

approved

#3 by Ron Hardin at Tue Mar 20 08:56:10 EDT 2012

LINKS

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

#2 by Ron Hardin at Tue Mar 20 08:55:50 EDT 2012

NAME

allocated for Ron Hardin1/4 the number of (n+1)X5 0..3 arrays with every 2X2 subblock having two or three distinct clockwise edge differences

DATA

43519, 10050240, 2266459861, 517186072378, 117888703860657, 26888341896724303, 6132398417786621509, 1398664622985458705816, 319003606034212278008442, 72757672377463379280503789

OFFSET

1,1

COMMENTS

Column 4 of A210335

EXAMPLE

Some solutions for n=4

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

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

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

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

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

KEYWORD

allocated

nonn

AUTHOR

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

STATUS

approved

editing

#1 by Ron Hardin at Tue Mar 20 08:50:29 EDT 2012

NAME

allocated for Ron Hardin

KEYWORD

allocated

STATUS

approved