330969

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=4A267281
• Number of 5 X n arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 5 and the upper left element equal to 0.at n=6A267285
• The number of weakly alternating bargraphs of semiperimeter n. A bargraph is said to be weakly alternating if its ascents and descents alternate. An ascent (descent) is a maximal sequence of consecutive U (D) steps.at n=17A275448