38782

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=24A050793
• Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.at n=33A095182
• Number of finite regions in a complete bipartite graph where the n vertices of each part are placed on the vertices, and on opposite sides, of a regular 2n-gon.at n=20A392972