145200

Appears in sequences

• Consider all integer triples (i,j,k), j >= k > 0, with i^3 = binomial(j+2,3) + binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=25A054208
• Partial sums of cupolar numbers (1/3)*(n+1)*(5*n^2+7*n+3) (A096000).at n=23A117066
• If p and q are twin primes then pq + 1 is always divisible by 3, except for (p,q)=(3,5). Sequence gives values of (pq + 1)/3.at n=28A165280
• Numbers with prime factorization pq^2r^2s^4.at n=23A190319
• Number of n X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 1 vertically.at n=6A207688
• Number of nX7 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 1 vertically.at n=6A207692
• Number of 7Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 1 vertically.at n=6A207698
• Number of n X 5 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=9A208139
• Numbers n such that phi(n) * tau(n) divides n^2, but neither tau(n) nor phi(n) divides n.at n=13A287800
• A(n, k) = Stirling2(n + k, k)*A053657(n)*k!/(n + k)!, array read by ascending antidiagonals for n >= 0 and k >= 0.at n=48A325146