19386

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=18A050793
• Smallest m such that A065623(m) = n.at n=20A065624
• Number of 13X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 13 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=11A192714
• Numbers n such that the Collatz iterations for n and n + 1 have the same length (A078417) but do not meet a certain condition. (See comments.)at n=29A274410
• Numbers k such that (5*10^k - 101)/3 is prime.at n=20A282506
• Number of ways to write a + b + c = d + e = f with {a,b,c,d,e,f} a subset of [n] of size 6 and a < b < c and d < e.at n=41A362717
• a(0) = 1; a(n) = Sum_{k=0..n-1} (4*k+1) * a(k) * a(n-k-1).at n=5A376087