26914

Appears in sequences

• a(n) is the smallest positive number such that the sum of A001032(n) consecutive squares starting with a(n)^2 is a square.at n=16A007475
• a(0) = 1, a(n) = 32*n^2 + 2 for n > 0.at n=29A010021
• 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). Sequence gives values of x.at n=27A050792
• Take an n X n square grid of points in the plane; a(n) = number of non-isomorphic ways to divide the points into two sets using a straight line.at n=28A116696
• Convolution of the Floor-Sqrt transform of central binomial coefficients.at n=13A192657
• T(n,k)=Number of nXk 0..3 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=46A222794
• Number of 2Xn 0..3 arrays with exactly floor(2Xn/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=8A222795
• The integer 907 and its infinite growing pattern (when iterating the rule explained in A316650 and hereunder, in the Comment section).at n=3A316679
• A382168 with duplicates removed.at n=39A382169