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!)
A085576 Array read by antidiagonals: T(n,k) = size of maximal subset of nodes in n X k grid such that there at least 3 edges between any pair of nodes (n >= 1, k >= 1). 2
1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 2, 3, 3, 4, 4, 4, 3, 3, 3, 4, 4, 5, 5, 4, 4, 3, 3, 4, 5, 6, 6, 6, 5, 4, 3, 4, 5, 6, 6, 7, 7, 6, 6, 5, 4, 4, 5, 6, 8, 8, 8, 8, 8, 6, 5, 4, 4, 6, 7, 8, 9, 9, 9, 9, 8, 7, 6, 4 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,7

COMMENTS

The 1-neighborhoods of the nodes must be disjoint: i.e. this is a 1-error correcting code.

LINKS

Table of n, a(n) for n=1..78.

FORMULA

T(n, 1) = floor((n+2)/3), T(n, 2) = floor((n+1)/2).

EXAMPLE

Array begins

1 1 1 2 2 2 3 3 3 4 ...

1 1 2 2 3 3 4 4 5 5 ...

1 2 2 3 4 4 5 6 6 7 ...

2 2 3 4 5 6 6 8 8 9 ...

For example, T(3,4) = 3 (*'s indicate the chosen nodes):

o--*--o--o

|..|..|..|

o--o--o--o

|..|..|..|

*--o--o--*

CROSSREFS

Main diagonal gives A085577.

Sequence in context: A235124 A235125 A238418 * A108622 A112348 A329199

Adjacent sequences:  A085573 A085574 A085575 * A085577 A085578 A085579

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane, Jul 08 2003

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 July 15 23:32 EDT 2020. Contains 335774 sequences. (Running on oeis4.)