41506

Appears in sequences

• Poly-Bernoulli numbers B_n^(k) with k=-4.at n=5A027651
• Expansion of ( 1-x ) / ( 1-3*x+x^2-x^3+x^4 ).at n=11A052985
• Array read by antidiagonals: poly-Bernoulli numbers B(-k,n).at n=49A099594
• Array read by antidiagonals: poly-Bernoulli numbers B(-k,n).at n=50A099594
• n^3 - (n+2)^2.at n=35A153258
• Number of ways to choose four collinear points from an n X n grid.at n=13A178256
• Number of permutations of 1..n with i-5<=p(i)<=i+4.at n=8A179340
• E.g.f.: Sum_{n>=0} (1 - exp(-(n+1)*x))^n/(n+1).at n=5A188634
• Number of acyclic orientations of the Turán graph T(n,2).at n=9A266695
• Number A(n,k) of acyclic orientations of the Turán graph T(n,k); square array A(n,k), n>=0, k>=1, read by antidiagonals.at n=64A267383
• Poly-Bernoulli numbers B_n^(k) with k = -5.at n=4A283811
• Numbers that are the sum of seven fourth powers in exactly eight ways.at n=26A345830
• Non-Brauer numbers.at n=25A349044
• Number of non-condensed integer partitions of n, or partitions where it is not possible to choose a different divisor of each part.at n=41A370320
• Triangle T(n,k) in which row n lists in increasing order the number of acyclic orientations of complete multipartite graphs K_lambda, where lambda is a partition of n into distinct parts; triangle T(n,k), n>=0, k = 1..A000009(n), read by rows.at n=30A370614
• Number T(n,k,j) of acyclic orientations of the complete tripartite graph K_{n,k,j}; triangle of triangles T(n,k,j), n>=0, k=0..n, j=0..k, read by rows.at n=45A372261