58080
domain: N
Appears in sequences
- Specific heat coefficients for square lattice spin 5/2 Ising model.at n=34A010114
- Number of reversible strings with n-1 beads of 2 colors. 7 beads are black. String is not palindromic.at n=13A032094
- a(n) = A062401(A065391(n)): phi(sigma(m)) peak values for numbers m (listed in A065391) at which those peaks are first reached.at n=28A065392
- Numbers k such that sigma(k^2-k-1) = k*(k+1).at n=39A069826
- Prime(prime(n))^2-1.at n=15A092771
- a(n) = number of ways to dispose two pawns on a chessboard of size n X n (two dispositions are equivalent if one can be rotated or reflected to give the other one).at n=31A141582
- Triangular array of generalized Narayana numbers: T(n, k) = 4*binomial(n+1, k+3)*binomial(n+1, k-1)/(n+1).at n=39A145598
- Triangular array of generalized Narayana numbers: T(n, k) = 4*binomial(n+1, k+3)*binomial(n+1, k-1)/(n+1).at n=41A145598
- a(n) = sinh(2*arccosh(n))^2 = 4*n^2*(n^2 - 1).at n=11A173121
- Numbers with prime factorization pqr^2s^5.at n=26A190293
- Number of 3 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=9A207171
- Positive integers, c, such that there are more than two solutions to the equation a^2 + b^3 = c^4, with a, b > 0.at n=36A242381
- Number of length 1+3 0..n arrays with no disjoint pairs in any consecutive four terms having the same sum.at n=14A247727
- Triangle read by rows: T(n,k) is the number of subpermutations of an n-set whose orbits are each of size at most k, and without fixed points. Equivalently, T(n,k) is the number of partial derangements of an n-set each of whose orbits is of size at most k.at n=34A261762
- Number of n-element subsets of [n+7] having an even sum.at n=14A282083
- a(n) = 16*n*(n+1)*(2*n+1)^2.at n=5A322677
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is 1/2 * (-1 + Sum_{j=0..k} binomial(2*k,2*j)*(n+1)^(k-j)*n^j).at n=50A322699
- a(0)=0, a(1)=5 and a(n) = 22*a(n-1) - a(n-2) + 10 for n > 1.at n=4A322707
- Triangle read by rows: T(n,k) is the number of linear chord diagrams on 2n vertices with one marked chord such that exactly k of the remaining n-1 chords are excluded by (i.e., are outside and do not contain) the marked chord.at n=26A336601
- Numbers k such that k and k+1 are both divisible by the square of their largest prime factor.at n=24A354558