151032
domain: N
Appears in sequences
- a(n) = floor(binomial(n,6)/6).at n=32A011852
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/5).at n=31A011915
- Number of ways to place 4 nonattacking queens on a 4 X n board.at n=24A061990
- Numbers that can be expressed as the difference of the squares of primes in exactly nine distinct ways.at n=20A092005
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+217)^2 = y^2.at n=36A198294
- The number of (simultaneously) fixed and isolated points in the digraph representation of all functions f:{1,2,...,n}->{1,2,...,n}.at n=7A200248
- Triangular array read by rows: T(n,k) is the number of endofunctions f:{1,2,...,n}-> {1,2,...,n} whose largest component has exactly k nodes; n>=1, 1<=k<=n.at n=26A209324
- Triangular array read by rows: T(n,k) is the number of size k components in the digraph representation of all functions f:{1,2,...,n}->{1,2,...,n}; n>=1, 1<=k<=n.at n=26A225723
- Expansion of f(-x^3, -x^7) * f(x^4, x^6) / psi(-x)^2 in powers of x where psi(), f(,) are Ramanujan theta functions.at n=36A259393
- Expansion of x * (d/dx) Sum_{k>=0} k!*x^(k*(k+1)/2)/Product_{j=1..k} (1 - x^j).at n=24A304797
- Triangle read by rows: T(n,k) is the number of endofunctions on [n] whose second-smallest component has size exactly k; n >= 0, 0 <= k <= max(0,n-1).at n=28A350079