24050

Appears in sequences

• Coordination sequence for D_5 lattice.at n=6A008355
• a(n) = n*(n+1)*(2*n+1)*(3*n+1)/6.at n=12A011195
• Numbers that are the sum of 2 nonzero squares in exactly 6 ways.at n=17A025289
• Numbers that are the sum of 2 nonzero squares in 5 or more ways.at n=25A025296
• Numbers that are the sum of 2 nonzero squares in 6 or more ways.at n=17A025297
• Numbers that are the sum of 2 distinct nonzero squares in exactly 6 ways.at n=17A025307
• Numbers that are the sum of 2 distinct nonzero squares in 5 or more ways.at n=23A025315
• Numbers that are the sum of 2 distinct nonzero squares in 6 or more ways.at n=17A025316
• T(2n+1,n+3), T given by A026747.at n=6A026867
• Number of proper factorizations of p1^n*p2^6, where p1 and p2 are distinct primes.at n=13A031129
• Starting from generation 8 add previous and next term yielding generation 9.at n=24A048455
• Numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^2 where w, x, y, and z are all positive integers.at n=25A057369
• 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=17A097103
• Square array T(n,k) read by antidiagonals: coordination sequence for lattice D_n.at n=34A103903
• Numbers that can be represented as a sum of two distinct nontrivial prime powers in three or more ways.at n=24A225104
• Numbers which are the sum of two squared primes in exactly three ways (ignoring order).at n=8A226562
• Number of nX6 0..6 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value (x(i,j)+1) mod 7, and upper left element zero.at n=3A230685
• T(n,k)=Number of nXk 0..6 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value (x(i,j)+1) mod 7, and upper left element zero.at n=39A230686
• Number of 4Xn 0..6 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value (x(i,j)+1) mod 7, and upper left element zero.at n=5A230688
• Smallest even number k such that lpf(k-3) = prime(n) while lpf(k-1) > lpf(k-3), where lpf=least prime factor (A020639).at n=32A242490