|
Search: id:A143999
|
|
|
| A143999 |
|
Rectangular array by antidiagonals: label each unit square in the 1st quadrant lattice by its northeast vertex (x,y) and mark squares for which (x,y) is congruent mod 4 to one of the following: (1,1), (2,3), (3,2), (4,0); then R(m,n) is the number of UNmarked squares in the rectangle [0,m]x[0,n]. |
|
+0
4
|
|
| 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 3, 2, 2, 2, 3, 3, 3, 3, 2, 2, 3, 4, 4, 4, 3, 2, 2, 4, 5, 5, 5, 5, 4, 2, 3, 4, 6, 6, 7, 6, 6, 4, 3, 3, 5, 6, 7, 8, 8, 7, 6, 5, 3, 3, 5, 7, 8, 9, 9, 9, 8, 7, 5, 3, 3, 6, 8, 9, 10, 11, 11, 10, 9, 8, 6, 3, 4, 6, 9, 10, 12, 12, 13, 12, 12, 10, 9, 6, 4, 4, 7, 9, 11, 13, 14, 14
(list; table; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
COMMENT
|
Row 4n is given by n*(1,2,3,4,5,6,...).
|
|
FORMULA
|
R(m,n)=mn-Floor(3mn/4).
|
|
CROSSREFS
|
Cf. A143996, A143997, A143998, A144000, A144001.
Sequence in context: A029282 A029286 A050333 this_sequence A137419 A057536 A014420
Adjacent sequences: A143996 A143997 A143998 this_sequence A144000 A144001 A144002
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Sep 07 2008
|
|
|
Search completed in 0.002 seconds
|
