35385

Appears in sequences

• Number of nonnegative solutions to x^2 + y^2 + z^2 <= n^2.at n=40A000604
• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.at n=25A050793
• a(n) = n^3 + (n + 1)^4 + (n + 2)^5.at n=6A061223
• Numbers n such that phi(n) + phi(n+1) = sigma(n)/2.at n=17A076647
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 1, 0), (1, -1, -1), (1, 1, 1)}.at n=8A150515
• Triangle read by rows, a(n,k), n>=k>=1, which represent the s=3, h=1 case of a two-parameter generalization of Stirling numbers arising in conjunction with normal ordering.at n=31A203412
• Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..2 array extended with zeros and convolved with -1,2,-1.at n=19A222037
• Number of partitions p of n such that 2*(number of even numbers in p) <= (number of odd numbers in p).at n=47A241652