The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A302455

Number of nX3 0..1 arrays with every element equal to 0, 2, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
(history; published version)

#4 by R. H. Hardin at Sun Apr 08 09:59:29 EDT 2018

STATUS

editing

approved

#3 by R. H. Hardin at Sun Apr 08 09:59:25 EDT 2018

LINKS

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

#2 by R. H. Hardin at Sun Apr 08 09:59:00 EDT 2018

NAME

allocated for R. H. Hardin

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

DATA

1, 11, 18, 55, 177, 474, 1397, 4135, 11882, 34847, 101857, 296482, 867237, 2532855, 7392050, 21600199, 63090609, 184246522, 538224973, 1572126423, 4591906058, 13413050687, 39179099921, 114439818402, 334276528661, 976412435063

OFFSET

1,2

COMMENTS

Column 3 of A302460.

FORMULA

Empirical: a(n) = 3*a(n-1) -2*a(n-2) +13*a(n-3) -23*a(n-4) +12*a(n-5) -42*a(n-6) +32*a(n-7) -24*a(n-8) -18*a(n-9) +24*a(n-10) +40*a(n-11) +32*a(n-12)

EXAMPLE

Some solutions for n=5

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

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

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

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

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

CROSSREFS

Cf. A302460.

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Apr 08 2018

STATUS

approved

editing

#1 by R. H. Hardin at Sun Apr 08 09:57:43 EDT 2018

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved