The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A299716

Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.
(history; published version)

#4 by R. H. Hardin at Sat Feb 17 10:38:08 EST 2018

STATUS

editing

approved

#3 by R. H. Hardin at Sat Feb 17 10:38:04 EST 2018

LINKS

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

#2 by R. H. Hardin at Sat Feb 17 10:37:37 EST 2018

NAME

allocated for R. H. Hardin

Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.

DATA

1, 13, 46, 246, 1205, 6354, 33804, 182056, 988181, 5383273, 29402184, 160807858, 880215678, 4820339682, 26404860216, 144663504555, 792635765966, 4343214217393, 23799184544981, 130412897747638, 714633600281963

OFFSET

1,2

COMMENTS

Column 3 of A299721.

FORMULA

Empirical: a(n) = 5*a(n-1) +11*a(n-2) -30*a(n-3) -94*a(n-4) +6*a(n-5) +166*a(n-6) +73*a(n-7) -28*a(n-8) +30*a(n-9) -24*a(n-10) -50*a(n-11) -6*a(n-12) for n>14

EXAMPLE

Some solutions for n=5

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

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

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

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

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

CROSSREFS

Cf. A299721.

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Feb 17 2018

STATUS

approved

editing

#1 by R. H. Hardin at Sat Feb 17 10:36:23 EST 2018

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved