82201
domain: N
Appears in sequences
- Triangle T(n,k) read by rows, where o.g.f. for T(n,k) is n!*Sum_{k=0..n} (1+x)^(n-k)/k!.at n=29A073474
- Number of solutions to x^2 + y^2 + z^2 < n^2; number of lattice points inside a sphere of radius n.at n=27A078183
- a(n) = Sum_{k=1..n} k*k!*C(n,k).at n=7A093964
- a(n) = 1 + Sum_{i=1..n} Sum_{j=1..n} i^j.at n=5A124405
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} in which the last entry of the first increasing run is equal to k (1 <= k <= n).at n=43A134433
- Number A(n,k) of paths starting at {n}^k to a border position where one component equals 0 using steps that decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=47A210472
- a(1) = 8, a(n) = smallest number > a(n-1) such that the concatenation of a(n-1) and a(n) is a square.at n=8A265149