[seqfan] Re: n X n binary array quasi-packing problem

[Rob Pratt]

1	0
2	2
3	5
4	9
5	15
6	22
7	31
8	40
9	51
10	64
11	78
12	94
13	111
14	129
15	148
16	170
17	192
18	215

-----Original Message-----
From: SeqFan [mailto:seqfan-bounces at list.seqfan.eu] On Behalf Of Ron Hardin
Sent: Friday, February 10, 2017 10:32 AM
To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
Subject: [seqfan] Re: n X n binary array quasi-packing problem

Can you easily do b=6, horizontal vertical and antidiagonal?
(I prefer antidiagonal because the word avoids implying both diagonals, and also the natural representation is more compact, making caching work better, when that matters.)
 rhhardin at mindspring.com rhhardin at att.net (either)

      From: Rob Pratt <Rob.Pratt at sas.com>
 To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu> 
 Sent: Friday, February 10, 2017 12:08 AM
 Subject: [seqfan] Re: n X n binary array quasi-packing problem
   
A few more terms for b = 4:
1    0
2    1
3    3
4    8
5    11
6    17
7    25
8    32
9    43
10    52
11    64
12    77
13    91
14    108
15    123
16    141
17    160
18    180
19    203
20    224



   

--
Seqfan Mailing list - http://list.seqfan.eu/