376803

Appears in sequences

• Number of nX(n+2) arrays of permutations of n+2 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.at n=8A267330
• Odd numbers k such that k and k+2 both have at least two divisors with the same value of the Euler totient function (A000010).at n=17A373527