A185090 Triangle read by rows: T(n,k) (n >= 2, 2 <= k <= n) = number of edge-disjoint spanners of delay 2 for complete bipartite graph K_{n,k}.

1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 3, 1, 2, 2, 2, 3, 3, 4, 1, 2, 2

Offset

2,6

References

Laforest, Christian; Liestman, Arthur L.; Shermer, Thomas C.; and Sotteau, Dominique; Edge-disjoint spanners of complete bipartite graphs. Discrete Math. 234 (2001), no. 1-3, 65-76.

Links

Table of n, a(n) for n=2..32.

Example

Triangle begins
1
1 1
1 1 2
1 1 2 2
1 2 2 2 3
1 2 2 2 3 3
1 2 2 2 3 3 4
1 2 2 2-3 3 3 4 4
...

Crossrefs

Sequence in context: A029435 A089643 A360240 * A115268 A103610 A305875

Adjacent sequences: A185087 A185088 A185089 * A185091 A185092 A185093

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Feb 04 2012

Status

approved