login

Revision History for A260603

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of (n+2)X(2+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010001 or 00010101
(history; published version)
#4 by R. H. Hardin at Wed Jul 29 22:38:14 EDT 2015
STATUS

editing

approved

#3 by R. H. Hardin at Wed Jul 29 22:38:10 EDT 2015
LINKS

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

#2 by R. H. Hardin at Wed Jul 29 22:37:53 EDT 2015
NAME

allocated for R. H. Hardin

Number of (n+2)X(2+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010001 or 00010101

DATA

58, 118, 250, 532, 1136, 2480, 5418, 11776, 25694, 56138, 122376, 266782, 582226, 1270070, 2769414, 6041044, 13178442, 28742456, 62690698, 136748242, 298274638, 650578696, 1419055920, 3095272272, 6751343236, 14725993444, 32120472836

OFFSET

1,1

COMMENTS

Column 2 of A260609

FORMULA

Empirical: a(n) = a(n-1) +4*a(n-3) +3*a(n-4) +2*a(n-6) +2*a(n-7) -4*a(n-8) +3*a(n-9) +4*a(n-10) -a(n-11) +a(n-12) +a(n-13) for n>14

EXAMPLE

Some solutions for n=4

..1..0..0..0....0..0..0..0....0..0..0..1....1..0..1..0....0..0..0..1

..0..1..0..0....1..0..0..0....1..0..1..0....0..1..0..0....1..0..0..0

..1..0..1..0....0..1..0..1....0..1..0..0....0..0..1..0....0..1..0..0

..0..0..0..1....1..0..0..0....0..0..1..0....0..1..0..0....0..0..1..0

..0..0..1..0....0..0..0..1....0..0..0..1....0..0..1..0....0..1..0..0

..0..1..0..0....0..0..1..0....0..0..1..0....0..1..0..0....0..0..1..0

CROSSREFS

Cf. A260609

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Jul 29 2015

STATUS

approved

editing

#1 by R. H. Hardin at Wed Jul 29 22:35:05 EDT 2015
NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved