29922

Appears in sequences

• Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 3).at n=63A046765
• Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 3).at n=63A046777
• Moments of generalized Motzkin paths.at n=16A053442
• a(n) = 997*n + 1009.at n=29A100776
• Square array of numbers A(n,k) (n>=0, k>=0) of transitive reflexive early confluent binary relations R on n labeled elements where |{y : xRy}| <= k for all x, read by antidiagonals.at n=59A135302
• Number of transitive reflexive early confluent binary relations R on n labeled elements where |{y : xRy}| <= 4 for all x.at n=6A210912
• Number of nX2 0..3 arrays with row sums unimodal and column sums inverted unimodal.at n=3A223660
• Number of nX4 0..3 arrays with row sums unimodal and column sums inverted unimodal.at n=1A223662
• T(n,k) = Number of n X k 0..3 arrays with row sums unimodal and column sums inverted unimodal.at n=11A223663
• T(n,k) = Number of n X k 0..3 arrays with row sums unimodal and column sums inverted unimodal.at n=13A223663
• Number of nX4 0..3 arrays with row sums and column sums unimodal.at n=1A224112
• T(n,k)=Number of nXk 0..3 arrays with row sums and column sums unimodal.at n=11A224113
• T(n,k)=Number of nXk 0..3 arrays with row sums and column sums unimodal.at n=13A224113
• Position of first occurrence of n in A238529 (Recursive depth of n modulo sopfr(n)).at n=6A238530
• Numbers with digits 2 and 9 only.at n=42A284923
• Expansion of Product_{k>=2} (1 + x^k)/(1 - x^k).at n=33A300415