28925

Appears in sequences

• Numbers that are the sum of 2 nonzero squares in exactly 6 ways.at n=24A025289
• Numbers that are the sum of 2 nonzero squares in 5 or more ways.at n=34A025296
• Numbers that are the sum of 2 nonzero squares in 6 or more ways.at n=25A025297
• Numbers that are the sum of 2 distinct nonzero squares in exactly 6 ways.at n=24A025307
• Numbers that are the sum of 2 distinct nonzero squares in 5 or more ways.at n=32A025315
• Numbers that are the sum of 2 distinct nonzero squares in 6 or more ways.at n=25A025316
• Partial sums of A051865.at n=25A050441
• Numbers m that are the hypotenuse of exactly 22 distinct integer-sided right triangles, i.e., m^2 can be written as a sum of two squares in 22 ways.at n=25A097103
• a(n) = 997*n + 1009.at n=28A100776
• Increasingly larger values in A110412.at n=15A111632
• Number of nX4 0..1 arrays with no more than floor(nX4/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=6A222537
• T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=51A222541
• Number of 7Xn 0..1 arrays with no more than floor(7Xn/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=3A222547
• Number of 2 X n 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=19A241055
• Number of (n+1) X (5+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 0,1 or 1,2.at n=1A264338
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 0,1 or 1,2.at n=16A264341
• Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 0,1 or 1,2.at n=4A264342
• Number n of antichains of P(En) x En*, ordered by lexicographic order, with En a poset of n elements with no pair of elements ordered, and with En* that same set augmented with an (n+1)th element smaller than all others.at n=3A271219