Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A301843

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

Showing all changes.
Number of 3Xn 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.
(history; published version)
#4 by R. H. Hardin at Tue Mar 27 14:32:54 EDT 2018
STATUS

editing

approved

#3 by R. H. Hardin at Tue Mar 27 14:32:51 EDT 2018
LINKS

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

#2 by R. H. Hardin at Tue Mar 27 14:32:34 EDT 2018
NAME

allocated for R. H. Hardin

Number of 3Xn 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.

DATA

4, 32, 139, 678, 3182, 15199, 72514, 346244, 1653214, 7893443, 37688062, 179946317, 859175558, 4102237937, 19586633161, 93518758201, 446516665710, 2131948036306, 10179244758257, 48602040050313, 232056341426270, 1107981178164225

OFFSET

1,1

COMMENTS

Row 3 of A301841.

FORMULA

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

EXAMPLE

Some solutions for n=5

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

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

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

CROSSREFS

Cf. A301841.

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Mar 27 2018

STATUS

approved

editing

#1 by R. H. Hardin at Tue Mar 27 14:25:30 EDT 2018
NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved