53599

Appears in sequences

• Quasi-Carmichael numbers to base 4: squarefree composites n such that (n,2*3) = 1 and prime p|n ==> p-4|n-4.at n=3A029559
• Structured rhombic triacontahedral numbers (vertex structure 11).at n=18A100164
• Product of the first n primes of the form 6k+1.at n=3A121940
• Multiples of 1729, the Hardy-Ramanujan number.at n=31A138129
• Smallest m such that m can be written in exactly n ways as x^2 + xy + y^2 with 0 <= x <= y.at n=8A198799
• Squared radii of circles around a point of the hexagonal lattice that contain a record number of lattice points.at n=9A230655
• Smallest k such that 2n - 1 divides sigma(k^2), or 0 if no such k exists.at n=40A283625
• 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=8A300419
• Odd numbers m such that sigma(x) = m has more than 1 solution.at n=20A300869
• 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=15A343771
• 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=13A344473
• Numbers k such that k^2 can be represented as x^2 + x*y + y^2 in more ways than for any smaller k.at n=7A357302
• 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=16A374090
• 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=8A374094
• a(n) is the smallest nonnegative integer k where exactly n pairs of positive integers (x, y) exist such that x^2 + 3*y^2 = k.at n=8A374158
• a(n) is the smallest positive integer k such that A096936(k) = n.at n=15A374295
• a(n) = sigma(A003961(n^2)), where A003961 is fully multiplicative with a(prime(i)) = prime(i+1), and sigma is the sum of divisors function.at n=41A379482
• Triangle read by rows: T(n,k) is the total number of humps with height k in all Motzkin paths of order n, n >= 2 and 1 <= k <= n/2.at n=52A379838
• All integers k that can produce a closed walk in an equilateral triangular lattice via noncongruent primitive k-length diagonals, in ascending order.at n=0A387031