The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A206205

Number of (n+1)X8 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases
(history; published version)

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

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Feb 04 2012

Discussion

Sat Mar 31

12:37

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

#4 by Ron Hardin at Sat Feb 04 18:17:35 EST 2012

STATUS

editing

approved

#3 by Ron Hardin at Sat Feb 04 18:17:32 EST 2012

LINKS

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

#2 by Ron Hardin at Sat Feb 04 18:17:13 EST 2012

NAME

allocated for Ron HardinNumber of (n+1)X8 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases

DATA

468968, 192808, 145208, 337896, 713408, 1080648, 3270240, 7008160, 10936160, 33660800, 72736960, 113216800, 339966080, 729156480, 1132733728, 3399739520, 7291568000, 11327337280, 33997395200, 72915680000, 113273372800

OFFSET

1,1

COMMENTS

Column 7 of A206206

FORMULA

Empirical: a(n) = 10*a(n-3) for n>17

EXAMPLE

Some solutions for n=4

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

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

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

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

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

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Feb 04 2012

STATUS

approved

editing

#1 by Ron Hardin at Sat Feb 04 18:09:22 EST 2012

NAME

allocated for Ron Hardin

KEYWORD

allocated

STATUS

approved