[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

Showing entries 1-10 | older changes
Number of (n+1) X (5+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).
(history; published version)
#12 by Jon E. Schoenfield at Mon Jun 20 21:33:28 EDT 2022
STATUS

editing

approved

#11 by Jon E. Schoenfield at Mon Jun 20 21:33:26 EDT 2022
NAME

Number of (n+1) X (5+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant -stress 1 X 1 tilings).

STATUS

approved

editing

#10 by Jon E. Schoenfield at Sun Jun 19 00:45:03 EDT 2022
STATUS

proposed

approved

#9 by Jon E. Schoenfield at Sun Jun 19 00:45:00 EDT 2022
STATUS

editing

proposed

#8 by Jon E. Schoenfield at Sun Jun 19 00:44:58 EDT 2022
EXAMPLE

.. 2.. 2.. 0.. 0.. 0.. 2.... 2.. 0.. 2.. 1.. 0.. 0.... 2.. 0.. 0.. 2.. 2.. 2.... 0.. 1.. 0.. 1.. 0.. 1

.. 2.. 0.. 0.. 2.. 0.. 0.... 0.. 0.. 0.. 1.. 2.. 0.... 0.. 0.. 2.. 2.. 0.. 2.... 2.. 1.. 2.. 1.. 2.. 1

.. 0.. 0.. 2.. 2.. 2.. 0.... 2.. 0.. 2.. 1.. 0.. 0.... 2.. 0.. 0.. 2.. 2.. 2.... 0.. 1.. 0.. 1.. 0.. 1

.. 0.. 2.. 2.. 0.. 2.. 2.... 0.. 0.. 0.. 1.. 2.. 0.... 0.. 0.. 2.. 2.. 0.. 2.... 1.. 0.. 1.. 0.. 1.. 0

.. 0.. 0.. 2.. 2.. 2.. 0.... 2.. 0.. 2.. 1.. 0.. 0.... 0.. 2.. 2.. 0.. 0.. 0.... 0.. 1.. 0.. 1.. 0.. 1

.. 2.. 0.. 0.. 2.. 0.. 0.... 0.. 0.. 0.. 1.. 2.. 0.... 2.. 2.. 0.. 0.. 2.. 0.... 1.. 0.. 1.. 0.. 1.. 0

STATUS

approved

editing

#7 by Susanna Cuyler at Sun Oct 14 09:19:26 EDT 2018
STATUS

proposed

approved

#6 by Colin Barker at Sun Oct 14 08:24:24 EDT 2018
STATUS

editing

proposed

#5 by Colin Barker at Sun Oct 14 08:23:48 EDT 2018
NAME

Number of (n+1) X (5+1) 0..2 arrays with every 2X2 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant stress 1X1 1 X 1 tilings).

COMMENTS

Column 5 of A234266

FORMULA

Empirical: a(n) = 3*a(n-1) + 6*a(n-2) - 24*a(n-3) + 4*a(n-4) + 36*a(n-5) - 24*a(n-6).

Empirical g.f.: 2*x*(280 - 463*x - 2261*x^2 + 3716*x^3 + 3498*x^4 - 5580*x^5) / ((1 - x)*(1 - 2*x)*(1 - 2*x^2)*(1 - 6*x^2)). - Colin Barker, Oct 14 2018

EXAMPLE

Some solutions for n=5:

CROSSREFS

Column 5 of A234266.

STATUS

approved

editing

#4 by R. H. Hardin at Sun Dec 22 08:45:40 EST 2013
STATUS

editing

approved

#3 by R. H. Hardin at Sun Dec 22 08:45:37 EST 2013
LINKS

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