The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A206236

Number of (n+1)X7 0..3 arrays with every 2X3 or 3X2 subblock having exactly two equal edges, and new values 0..3 introduced in row major order
(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 05 2012

Discussion

Sat Mar 31

12:37

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

#4 by Ron Hardin at Sun Feb 05 07:16:12 EST 2012

STATUS

editing

approved

#3 by Ron Hardin at Sun Feb 05 07:16:09 EST 2012

LINKS

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

#2 by Ron Hardin at Sun Feb 05 07:15:50 EST 2012

NAME

allocated for Ron HardinNumber of (n+1)X7 0..3 arrays with every 2X3 or 3X2 subblock having exactly two equal edges, and new values 0..3 introduced in row major order

DATA

51066, 170728, 607008, 9042600, 118573968, 1448239080, 22535636736, 303011941944, 3712941210144, 57939122017416, 779043702707184, 9545971851249384, 148961482706745696, 2002921359660139224

OFFSET

1,1

COMMENTS

Column 6 of A206238

FORMULA

Empirical: a(n) = a(n-1) +2571*a(n-3) -2571*a(n-4) for n>10

EXAMPLE

Some solutions for n=4

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

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

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

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

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

KEYWORD

allocated

nonn

AUTHOR

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

STATUS

approved

editing

#1 by Ron Hardin at Sun Feb 05 07:09:18 EST 2012

NAME

allocated for Ron Hardin

KEYWORD

allocated

STATUS

approved