28640

Appears in sequences

• Number of unlabeled planar trees (also called plane trees) with n nodes.at n=14A002995
• Dowling numbers: e.g.f.: exp(x + (exp(b*x) - 1)/b) with b=2.at n=7A007405
• Expansion of sum ( q^n / product( 1-q^k, k=1..6*n), n=0..inf ).at n=32A035298
• Triangle A(r,c) read by rows, which contains the row sums of the triangle T(n,k)= T(n-1,k-1)+((c-1)*k+1)*T(n-1,k) in column c.at n=58A111579
• Array T(n,k) read by antidiagonals: the k-th column contains the first column of the k-th power of A039755.at n=43A111670
• Difference between n-th Fibonacci number and floored n-th power of Viswanath's constant.at n=22A140443
• 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, 1), (-1, 1, -1), (0, 0, 1), (1, -1, 0), (1, 1, -1)}.at n=10A148359
• Number of lattice paths from (0,0) to (n,n) using steps S={(k,0),(0,k),(r,r)|k>0,0<r<=2} which never go above the line y=x.at n=6A175939
• Number of (w,x,y) with all terms in {0,...,n} and w != min(|w-x|, |x-y|).at n=30A213499
• Partial sums of A267326.at n=21A264390
• a(n) = phi(A291789(n)).at n=22A291805
• The numbers k for which gcd(k, phi(k)) + gcd(k, tau(k)) = gcd(k, sigma(k)).at n=4A326416
• Square array A(n,k), n >= 0, k >= 1, read by antidiagonals: A(n,k) = exp(-1/k) * Sum_{j>=0} (k*j + 1)^n / (k^j * j!).at n=43A334165