The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A260284

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00001011
(history; published version)

#4 by R. H. Hardin at Wed Jul 22 07:47:52 EDT 2015

STATUS

editing

approved

#3 by R. H. Hardin at Wed Jul 22 07:47:48 EDT 2015

LINKS

R. H. Hardin, <a href="/A260284/b260284.txt">Table of n, a(n) for n = 1..683</a>

#2 by R. H. Hardin at Wed Jul 22 07:47:30 EDT 2015

NAME

allocated for R. H. Hardin

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00001011

DATA

34, 46, 46, 99, 85, 99, 202, 230, 230, 202, 366, 525, 747, 525, 366, 714, 1150, 2027, 2027, 1150, 714, 1428, 2726, 5420, 6044, 5420, 2726, 1428, 2750, 6351, 15306, 18380, 18380, 15306, 6351, 2750, 5291, 14393, 42175, 60955, 65907, 60955, 42175, 14393

OFFSET

1,1

COMMENTS

Table starts

....34....46.....99.....202......366.......714.......1428........2750

....46....85....230.....525.....1150......2726.......6351.......14393

....99...230....747....2027.....5420.....15306......42175......114513

...202...525...2027....6044....18380.....60955.....192277......595506

...366..1150...5420...18380....65907....264502.....984644.....3594132

...714..2726..15306...60955...264502...1271212....5588466....24324681

..1428..6351..42175..192277...984644...5588466...28517537...145143631

..2750.14393.114513..595506..3594132..24324681..145143631...866931786

..5291.33241.316679.1903722.13692107.110763233..777843590..5496336586

.10334.77098.874845.6052530.51665854.496845217.4078878260.33909426271

FORMULA

Empirical for column k:

k=1: a(n) = a(n-1) +3*a(n-3) +a(n-4) +a(n-8) for n>10

k=2: a(n) = a(n-1) +7*a(n-3) +a(n-4) +a(n-5) -7*a(n-6) -4*a(n-7) +3*a(n-9) for n>12

k=3: [order 14] for n>19

k=4: [order 21] for n>26

k=5: [order 39] for n>44

k=6: [order 57] for n>63

k=7: [order 75] for n>81

EXAMPLE

Some solutions for n=4 k=4

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

..1..0..0..0..0..0....0..0..0..0..0..1....0..0..1..0..0..0....0..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..0..0..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..1..0..0..1..0....1..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..1..0

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

KEYWORD

allocated

nonn,tabl

AUTHOR

R. H. Hardin, Jul 22 2015

STATUS

approved

editing

#1 by R. H. Hardin at Wed Jul 22 07:38:04 EDT 2015

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved