157339
domain: N
Appears in sequences
- Numbers whose square is expressible as the difference of positive cubes in more than one way.at n=2A051393
- Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(3*i-2) ) and m = 1, read by rows.at n=17A156722
- Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(3*i-2) ) and m = 1, read by rows.at n=18A156722
- Smallest m such that m can be written in exactly n ways as x^2 + xy + y^2 with 0 <= x <= y.at n=9A198799
- Squared radii of circles around a point of the hexagonal lattice that contain a record number of lattice points.at n=10A230655
- Smallest nonnegative number k such that k can be written in exactly n ways as x^2 + xy + y^2 where x and y are positive integers, with x >= y.at n=9A300419
- Smallest k such that circle centered at the origin and with radius sqrt(k) passes through exactly 6*n integer points in the hexagonal lattice (see A004016).at n=17A343771
- Numbers of the form (q1^b1)(q2^b2)(q3^b3)(q4^b4)(q5^b5)... where q1=7, q2=13, q3=19, q4=31, q5=37, ... (A002476) and b1>=b2>=b3>=b4>=b5...at n=17A344473
- If F is the Fermat point of a triangle ABC with A < B < C < 2*Pi/3, where AB, BC, CA, FA, FB and FC are all positive integers, then, this sequence gives the sum FA + FB + FC when gcd(a, b, c) = A351477(n).at n=31A351476
- a(n) is the smallest nonnegative integer k where exactly n ordered pairs of positive integers (x, y) exist such that x^2 + x*y + y^2 = k.at n=18A374090
- a(n) is the smallest nonnegative integer k where there are exactly n solutions to x^2 + x*y + y^2 = k with 0 < x < y.at n=9A374094