35442

Appears in sequences

• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.at n=21A050793
• a(n) = n*(94 + 5*n + 25*n^2 - 5*n^3 + n^4)/120.at n=22A057703
• Numbers n such that p(8n) is prime, where p(n) is the number of partitions of n.at n=35A114168
• Number of strictly increasing arrangements of 5 nonzero numbers in -(n+3)..(n+3) with sum zero.at n=24A188124
• Number of (n+2)X(4+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=16A254903
• a(n) is the permanent of the n-th order Hankel matrix of Catalan numbers M(n) whose generic element is given by M(i,j) = A000108(i+j+5) with i,j = 0, ..., n-1.at n=2A368023
• Array read by ascending antidiagonals: A(n, k) is the permanent of the n-th order Hankel matrix of Catalan numbers M(n) whose generic element is given by M(i,j) = A000108(i+j+k) with i,j = 0, ..., n-1.at n=33A368026
• Numbers k that divide the k-th companion Pell number.at n=39A372899