168948

Appears in sequences

• G.f. satisfies: A(x) = Sum_{n>=0} x^n*g_n(x)^n where g_n(x) = A(x) - x^n*g_n(x)^n for n>=0.at n=13A187010
• Number of (n+2) X 3 binary arrays avoiding patterns 001 and 101 in rows and columns.at n=35A202195
• Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 1,-2 or 1,1.at n=2A264139
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,-2 or 1,1.at n=23A264142
• Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 1,-2 or 1,1.at n=4A264143
• a(n) is the index of the first occurrence of n in A331284.at n=47A331285