40295

Appears in sequences

• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (0, -1), (0, 1), (1, -1), (1, 1)}.at n=10A151443
• Triangle T(n,k) read by rows: T(n,k) = (k-1)*T(n-1,k) + (n-k+2)*T(n-1, k-1), with T(n,1)=1, for 1 <= k <= n, n >= 1.at n=53A157011
• Number of (n+5) X 10 0..1 matrices with each 6 X 6 subblock idempotent.at n=13A224574
• Number of n-length words w over a 6-ary alphabet {a_1,...,a_6} such that w contains never more than j consecutive letters a_j (for 1<=j<=6).at n=6A242629
• Number of n-length words w over an n-ary alphabet {a_1,...,a_n} such that w contains never more than j consecutive letters a_j for 1<=j<=n.at n=6A242635
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 489", based on the 5-celled von Neumann neighborhood.at n=37A272512
• a(n) is the number of triangular partitions whose Young diagram fits inside a square of side n.at n=34A368638