47652

Appears in sequences

• Number of walks of length 2n+8 in the path graph P_9 from one end to the other.at n=6A005024
• Number of triples {i,j,k}, i>1, j>1, k>1, such that i*j*k < n^3.at n=20A037092
• Number of self-avoiding walks on a 2-D lattice of length n which start at the origin, take first step in the {+1,0} direction and whose vertices are always nonnegative in x and y.at n=12A046170
• Trajectory of 41 under map x -> A002487(x)*A002487(x+1).at n=13A071886
• G.f.: (1+x)/Product_{m>0} (1 - x^m).at n=38A084376
• Expansion of x^3/((1-3*x+x^2)*(1-5*x+5*x^2)).at n=10A094865
• Integers that are Rhonda numbers to base 9.at n=6A100973
• a(n) = Sum_{k=0..n} A033184(n,k)*A033184(n,n-k), where Catalan triangle entry A033184(n,k) = C(2*n-k,n-k)*(k+1)/(n+1).at n=7A143388
• Number of n X n symmetric (0,1)-matrices containing four ones.at n=18A185355
• Number of n X 7 binary arrays without the pattern 0 1 diagonally or vertically.at n=6A188841
• a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * (3*k-2) * a(n-k).at n=6A337552
• Triangle read by rows: T(n, k) = binomial(2*k + n - 1, k - 2)*(n^2 - 2*k + n)/(k*(k - 1)) for k >= 2, T(n, 0) = 1 and T(n, 1) = n - 1.at n=52A387700