The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A260835

(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 00000001 00000011 or 00010101
(history; published version)

#4 by R. H. Hardin at Sat Aug 01 06:10:30 EDT 2015

STATUS

editing

approved

#3 by R. H. Hardin at Sat Aug 01 06:10:27 EDT 2015

LINKS

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

#2 by R. H. Hardin at Sat Aug 01 06:10:13 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 00000001 00000011 or 00010101

DATA

82, 131, 288, 496, 796, 1645, 2976, 4890, 9332, 17659, 30090, 54846, 104380, 184549, 329454, 618800, 1121728, 1998197, 3692344, 6772932, 12142202, 22172787, 40769872, 73664484, 133728146, 245325455, 445857864, 808254626, 1477620470

OFFSET

1,1

COMMENTS

Column 2 of A260841

FORMULA

Empirical: a(n) = a(n-1) +5*a(n-3) -a(n-4) -3*a(n-5) -5*a(n-6) +3*a(n-9) -2*a(n-10) -5*a(n-11) -2*a(n-12) -a(n-13) +5*a(n-14) -2*a(n-15) -2*a(n-17) +2*a(n-18) for n>19

EXAMPLE

Some solutions for n=4

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

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

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

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

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

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

CROSSREFS

Cf. A260841

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Aug 01 2015

STATUS

approved

editing

#1 by R. H. Hardin at Sat Aug 01 06:07:12 EDT 2015

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved