[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A297459 (Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A297459 Number of 3 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0 or 2 neighboring 1s.
(history; published version)
#8 by Alois P. Heinz at Thu Feb 28 16:43:54 EST 2019
STATUS

reviewed

approved

#7 by Michel Marcus at Thu Feb 28 15:04:03 EST 2019
STATUS

proposed

reviewed

#6 by Colin Barker at Thu Feb 28 14:16:11 EST 2019
STATUS

editing

proposed

#5 by Colin Barker at Thu Feb 28 14:15:48 EST 2019
NAME

Number of 3 X 3Xnn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0 or 2 neighboring 1s.

COMMENTS

Row 3 of A297457.

FORMULA

Empirical: a(n) = 3*a(n-1) +) + 4*a(n-2) -) - 7*a(n-3) +) + 8*a(n-4) -) - 19*a(n-5) +) + 8*a(n-6) +) + 2*a(n-8)).

Empirical g.f.: x*(8 - 5*x + 3*x^2 - 11*x^3 - 11*x^4 + 8*x^5 + 2*x^6 + 2*x^7) / (1 - 3*x - 4*x^2 + 7*x^3 - 8*x^4 + 19*x^5 - 8*x^6 - 2*x^8). - Colin Barker, Feb 28 2019

EXAMPLE

Some solutions for n=7:

CROSSREFS

Cf. Row 3 of A297457.

STATUS

approved

editing

#4 by R. H. Hardin at Sat Dec 30 11:11:22 EST 2017
STATUS

editing

approved

#3 by R. H. Hardin at Sat Dec 30 11:11:18 EST 2017
LINKS

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

#2 by R. H. Hardin at Sat Dec 30 11:11:00 EST 2017
NAME

allocated for R. H. Hardin

Number of 3Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0 or 2 neighboring 1s.

DATA

8, 19, 92, 285, 1143, 3933, 14817, 52868, 194822, 704284, 2575201, 9352440, 34103042, 124055943, 451921339, 1644897204, 5990104595, 21807171062, 79403933671, 289093577711, 1052597637063, 3832392357045, 13953632474038

OFFSET

1,1

COMMENTS

Row 3 of A297457.

FORMULA

Empirical: a(n) = 3*a(n-1) +4*a(n-2) -7*a(n-3) +8*a(n-4) -19*a(n-5) +8*a(n-6) +2*a(n-8)

EXAMPLE

Some solutions for n=7

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

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

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

CROSSREFS

Cf. A297457.

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Dec 30 2017

STATUS

approved

editing

#1 by R. H. Hardin at Sat Dec 30 11:02:42 EST 2017
NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 00:57 EDT 2024. Contains 375520 sequences. (Running on oeis4.)