29366

Appears in sequences

• Numerators of continued fraction convergents to sqrt(329).at n=8A041620
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=8A150266
• Largest number which requires n iterations of the unitary totient function (A047994) to reach 1.at n=13A225172
• Number of (n+1) X (3+1) 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=4A231258
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=25A231263
• Number of (5+1)X(n+1) 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=2A231267
• Number of irredundant sets in the n X n rook complement graph.at n=6A291622
• a(n) = coefficient of x^n in A(x) where 1 = Sum_{n=-oo..+oo} (2*x + (-x)^n*A(x)^n)^n.at n=10A359673
• G.f. A(x) satisfies 1 = Sum_{n=-oo..+oo} (A(x)^n - 2*x)^n.at n=10A378829