### Table 1: The Catalan triangle

"... In PAGE 14: ... Other properties of Dyck paths, related to Catalan numbers, have also been studied. For example, the so-called Catalan triangle in Table1 is de ned by the fact that its generic element cn;k counts the number of partial Dyck paths arriving at the point (n; n?k); in that case, Catalan numbers appear both as column 0 and as the row sums of the in nite triangle. A common way of de ning Dyck paths is through a context-free grammar: Dyck paths correpond to Dyck words, i.... ..."

### Table 3. Percentage of dynamic congruent ref- erences undetected when different data sets are used for profiling and execution.

2002

Cited by 16

### Table 3. Percentage of dynamic congruent ref- erences undetected when different data sets are used for profiling and execution.

2002

Cited by 16

### Table 3. Percentage of dynamic congruent ref- erences undetected when different data sets are used for profiling and execution.

2002

Cited by 16

### Table 1 (p. 257) shows several further observations in clinical and neuro- cognitive sciences congruent with the portrayed scenario.

### Table 3. Reverse Stroop RT (in ms) by Response Mode to Congruent and Incongruent Stimuli, and the Resulting Congruity Effects.

### Table 4.1: Terms in equation 4.4 congruent to zero modulo 5

### Table 4. The number of Carmichael numbers congruent to c modulo m for m = 5; 7; 11; 12

1992

"... In PAGE 6: ... Pomerance [21,22] gave a heuristic argument suggesting that lim k = 1. In Table4 we give the number of Carmichael numbers in each class modulo m for m = 5, 7, 11 and 12. In Tables 5 and 6 we give the number of Carmichael numbers divisible by primes p... ..."

### Table 4: The prime factorization of the congruent pairs in Table 2 with the exponents taken modulo 2.

in 1

2002

"... In PAGE 14: ... Since we have to choose elements in such a way that their product is a square, we have to make sure that the exponent of each prime is even, in a and b together. Therefore the simpli ed Table4 is su cient for our algorithm. Let B denote the matrix of size n1 n2, where the elements are equal to the exponents modulo 2 of the prime factors, as given in Table 4.... In PAGE 15: ... It is also possible, especially for large numbers, that there are more solutions for the vector x. For example let x = [1; 1; 1; 0; 0; 0; 0; 1; 0; 0], which corresponds in Table4 to the 1st, 2nd, 3rd and 8th columns. It satis es also gcd(XY; N) = gcd(10240; 33) = 1, and gcd(X Y; N) = gcd(320 32; 33) = gcd (288; 33) = 3, resulting in factor 3.... ..."