52785
domain: N
Appears in sequences
- Expansion of Product_{k>=1} (1 - x^k)^18.at n=16A010824
- (Concatenation of T(n)+1..T(n+1)) mod (concatenation of T(n-1)+1..T(n)), where T(k) is the k-th triangular number, A000217(k).at n=3A095222
- a(n) = binomial(n,4) - binomial(floor(n/2),4) - binomial(ceiling(n/2),4).at n=36A111385
- Matrix cube of triangle W = A136231; also equals P^9, where P = triangle A136220.at n=32A136238
- Numbers k such that k and k^2 use only the digits 2, 5, 6, 7 and 8.at n=32A137111
- 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, 1, 1), (0, 1, 0), (1, 0, 0), (1, 1, -1)}.at n=9A149974
- Hyper-Wiener index of a benzenoid consisting of a chain of n hexagons characterized by the encoding s = 1133 (see the Gutman et al. reference, Sec. 5).at n=11A193400
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+84847)^2 = y^2.at n=30A201917
- Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 2*x + 5.at n=16A257615
- Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 2*x + 5.at n=19A257615
- Let p = n-th prime == 7 mod 8; a(n) = sum of quadratic residues mod p that are < p/2.at n=39A282039
- Partial sums of A299272.at n=34A299273
- G.f. A(x) satisfies A(x) = (1 + 9*x*A(x)^3)^(2/3).at n=4A386414