21955

Appears in sequences

• a(n) = n^3 + 3.at n=28A084378
• Numbers n such that p(9n) is prime, where p(n) is the number of partitions of n.at n=29A114169
• Number of (n+1)X(n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=2A250520
• Number of (n+1)X(3+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=2A250522
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=12A250527
• Number of (n+1)X(n+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=2A250986
• Number of (n+1)X(3+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=2A250989
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=12A250994
• Number of (3+1)X(n+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=2A250997
• Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes or outdegrees larger than nine.at n=12A292215
• Number of inversion sequences of length n avoiding the consecutive patterns 000 and 100.at n=8A328440
• Number of partitions of n containing a prime number of distinct primes and an arbitrary number of nonprimes.at n=39A344715