51293

Appears in sequences

• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x.at n=35A050788
• Positions of 11's in A131744.at n=26A133152
• Number of partitions of n*(n+1)/2 with at most four parts that can be obtained from grouping (with parentheses) a permutation of the sum 1+2+...+n.at n=19A160438
• Number of ways to reciprocally link elements of an 2 X n array either to themselves or to exactly one horizontal or antidiagonal neighbor.at n=9A220563
• Numbers k such that prime(k) + 1, ..., prime(k + 5) + 1 have the same number of prime divisors (with multiplicity).at n=15A255193
• Number of set partitions of [n] such that for each block all absolute differences between consecutive elements are <= three.at n=11A287275
• Number of 3Xn 0..1 arrays with every element equal to 0, 1, 2 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=12A302416