33412

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=23A050793
• Values of m such that A139361(n)=4m+1.at n=40A139362
• The numbers n in s=n^2 + (n+1)^2 that satisfy the requirement for two consecutive squares c,d with c<d with d-c being the sum of two consecutive squares that c<s<d will give s-c and d-s both being squares.at n=26A192743
• Numbers k such that 4*10^k - 99 is prime.at n=24A278960
• Numbers k such that 28*10^k + 1 is prime.at n=20A293824
• Number of 3 X n 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=12A302311