30952

Appears in sequences

• Red rooted red-black trees with n internal nodes.at n=19A001138
• Numbers k such that phi(k) + 9 | sigma(k).at n=10A015800
• Third row of Pascal-(1,2,1) array A081577.at n=19A081583
• Least k such that Sum_{r=n+1..k} r >= n!.at n=11A093000
• 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, 0, -1), (0, 0, 1), (0, 1, 0), (1, -1, -1)}.at n=10A149815
• E.g.f. satisfies: A'(x) = 1 + A(x)*exp(A(x)).at n=7A235129
• Number of partitions of n such that 2*(least part) < greatest part.at n=38A237820
• Number of (n+1) X (1+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=5A250585
• Number of (n+1)X(6+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=0A250590
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=15A250592
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=20A250592
• Numbers k such that k | (sigma(k-2) + sigma(k-1) + sigma(k+1) + sigma(k+2)).at n=7A296027
• Number of parts in all partitions of n with largest multiplicity ten.at n=32A320380
• a(n) = n! [x^n] exp((1/(x - 1)^2 - 1)/2)/(1 - x).at n=6A321965