33371

Appears in sequences

• Open 3-dimensional ball numbers (version 1): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (0,0,0).at n=40A053592
• Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n.at n=18A074348
• Number of solutions to x^2 + y^2 + z^2 < n^2; number of lattice points inside a sphere of radius n.at n=20A078183
• a(n) = 2*7^n-3^n.at n=5A081657
• a(n) = 1 + (26*n+17+7*n^2)*n/2.at n=20A095796
• Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 110-111-010 pattern in any orientation.at n=9A146243
• Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 110-111-010 pattern in any orientation.at n=20A146245
• Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 110-111-010 pattern in any orientation.at n=21A146245