25731

Appears in sequences

• a(n) = 2*A000984(n) - (n+1).at n=8A134759
• a(n) = 4*3^n - 2*2^n - 1.at n=8A135914
• Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 0100-1111-0010 pattern in any orientation.at n=11A146368
• Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 0100-1111-0010 pattern in any orientation.at n=24A146370
• Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 0100-1111-0010 pattern in any orientation.at n=25A146370
• Wiener index of the n-web graph.at n=26A180576
• Number of 6's in the last section of the set of partitions of n.at n=51A206556
• A generalized Engel expansion of 1/Pi.at n=6A232327
• Numbers x such that the sum of all their cyclic permutations is equal to that of all cyclic permutations of sigma(x) and all cyclic permutations of Euler totient function phi(x).at n=28A247317
• p-INVERT of (0,1,0,1,0,1,...), where p(S) = (1 - S^3)^3.at n=19A291252
• Numbers k such that F(k)*F(k+1) + F(k+2) is a prime, where F = A000045 (Fibonacci numbers).at n=32A305414
• On a spirally numbered square grid, with labels starting at 1, this is the number of steps that an (n,n+1) leaper makes before getting trapped, or -1 if it never gets trapped.at n=19A343178
• Antidiagonal-sums of the absolute value of the array A377033(n,k) = n-th term of the k-th differences of the composite numbers (A002808).at n=19A377035