50920

Appears in sequences

• Numbers k such that sum of divisors of k^2 is a square.at n=12A008847
• 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=30A050793
• Numbers which can be expressed as the product of a number and its reversal in at least two different ways.at n=31A066531
• Expansion of (1-z-sqrt(1-4z))/(1-4z)^2.at n=6A104598
• Number of (n+1)X2 0..4 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=4A204725
• Number of (n+1)X6 0..4 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=0A204729
• T(n,k) = Number of (n+1) X (k+1) 0..4 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=10A204732
• T(n,k) = Number of (n+1) X (k+1) 0..4 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=14A204732
• Number of non-equivalent ways to choose two points in an equilateral triangle grid of side n.at n=38A227327