login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140304 Number of n X n binary matrices with no more than one 1 in any 3 X 3 sub-block. 2
1, 2, 5, 10, 60, 437, 2875, 36409, 704468, 14783959, 461938624, 22488554884, 1378748967395, 115759328877461, 14408020654986447, 2435526103569141336, 559083220302137929773, 182904062593977747117174, 83283166161035345074485948, 52012981990902321891650583747, 45449967513840995133445585972949 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..23

R. J. Mathar, Tiling n X m rectangles with 1 X 1 and s X s squares, arXiv:1609.03964 [math.CO], 2016.

MATHEMATICA

$RecursionLimit = 10^4;

b[n_, l_] := b[n, l] = Module[{k, m}, m = Min[l]; Which[n < 3, 1, m > 0, b[n - m, l - m], True, k = 1; While[l[[k]] > 0, k++]; b[n, ReplacePart[l, k -> 1]] + Expand[If[k + 1 < Length[l] && l[[k + 1 ;; k + 2]] == {0, 0}, b[n, ReplacePart[l, {k -> 3, k + 1 -> 3, k + 2 -> 3}]]*x, 0]]]];

a[n_] := a[n] = Function[p, Sum[Coefficient[p, x, i], {i, 0, Exponent[p, x]}]][b[n + 2, Table[0, n + 2]]];

Table[Print["a(", n, ") = ", a[n]]; a[n], {n, 0, 15}] (* Jean-Fran├žois Alcover, Nov 11 2017, after Alois P. Heinz *)

CROSSREFS

Cf. A139810. Row sums of A276171.

Sequence in context: A020755 A018503 A018535 * A183451 A018549 A053356

Adjacent sequences:  A140301 A140302 A140303 * A140305 A140306 A140307

KEYWORD

nonn

AUTHOR

R. H. Hardin, May 27 2008

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 10:04 EDT 2020. Contains 334825 sequences. (Running on oeis4.)