A262488 T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column divisible by 13, read as a binary number with top and left being the most significant bits.

2, 3, 3, 5, 5, 5, 10, 9, 9, 10, 20, 23, 17, 23, 20, 40, 63, 61, 61, 63, 40, 79, 171, 245, 389, 245, 171, 79, 158, 449, 877, 2699, 2699, 877, 449, 158, 316, 1251, 3025, 16108, 33742, 16108, 3025, 1251, 316, 631, 3753, 11357, 93941, 364259, 364259, 93941, 11357, 3753

Offset

1,1

Comments

Table starts

...2.....3......5......10.......20........40........79......158.....316

...3.....5......9......23.......63.......171.......449.....1251....3753

...5.....9.....17......61......245.......877......3025....11357...56785

..10....23.....61.....389.....2699.....16108.....93941...601676.4905724

..20....63....245....2699....33742....364259...3810228.45013100

..40...171....877...16108...364259...6945738.128397052

..79...449...3025...93941..3810228.128397052

.158..1251..11357..601676.45013100

.316..3753..56785.4905724

.631.10361.172369

Links

R. H. Hardin, Table of n, a(n) for n = 1..82

Formula

Empirical for column k:

k=1: a(n) = 3*a(n-1) -2*a(n-2) -a(n-6) +3*a(n-7) -2*a(n-8)

k=2: [order 47]

Example

Some solutions for n=4 k=4
..1..0..0..0..0..0..1....1..1..1..0..1..0..1....1..1..1..0..1..0..1
..0..0..1..1..0..1..0....1..0..0..0..0..0..1....1..0..0..0..0..0..1
..0..0..1..1..0..1..0....1..0..0..0..0..0..1....0..0..0..0..0..0..0
..1..0..0..0..0..0..1....0..1..1..0..1..0..0....1..0..0..0..0..0..1
..1..0..1..1..0..1..1....1..1..1..0..1..0..1....0..0..0..0..0..0..0
..1..0..0..0..0..0..1....0..1..1..0..1..0..0....0..0..0..0..0..0..0
..0..0..0..0..0..0..0....1..0..0..0..0..0..1....0..1..1..0..1..0..0

Crossrefs

Sequence in context: A262457 A286870 A262319 * A278530 A330332 A023816

Adjacent sequences: A262485 A262486 A262487 * A262489 A262490 A262491

Keyword

nonn,tabl

Author

R. H. Hardin, Sep 24 2015

Status

approved