36840

Appears in sequences

• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.at n=23A050789
• a(n) = 64*n^2 - n.at n=23A157948
• a(n) = 256*n^2 - 2*n.at n=11A158249
• a(n) = 576*n^2 - 24.at n=7A158636
• Number of n X n 0..4 arrays with row sums 5 and column sums 5.at n=3A172809
• Number of n X n 0..4 arrays with row sums 11 and column sums 11.at n=3A172812
• Numbers n such that sigma(sigma(n))/sigma(n) > sigma(sigma(m))/sigma(m) for all m < n.at n=26A289124
• Number of integer partitions of n with exactly two distinct multiplicities.at n=48A325243
• a(n) is the number of edges formed by n-secting the angles of an octagon.at n=36A335771
• T(n,k) is the number of connected labeled posets with n elements and rank k: triangle read by rows.at n=18A342501
• Number of edges in a regular 2n-gon when all vertices are connect by straight lines except for the n lines joining diametrically opposite vertices.at n=14A368815