48020
domain: N
Appears in sequences
- a(n) = Sum_{ d >= 1, d divides n} (-1)^(n-d)*d^3.at n=37A008457
- Triangle of coefficients in expansion of (4+7x)^n.at n=19A013625
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*4^j.at n=16A038270
- Numbers whose base-6 representation has exactly 7 runs.at n=22A043615
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n.at n=33A057264
- a(n) = Sum_{d divides n} (-1)^(n/d+1)*d^3.at n=37A078307
- Numbers n such that P(13*n) is prime, where P(n) is the unrestricted partition number.at n=27A113518
- a(n) = 7^n * n*(n+1).at n=4A116165
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+2401)^2 = y^2.at n=18A118630
- Totally multiplicative sequence with a(p) = 7*(p+2) for prime p.at n=29A167308
- Number of all polyhedra (tetrahedra of any orientation and octahedra) of any size, formed when intersecting a regular tetrahedron by planes parallel to its sides and dividing its edges into n equal parts.at n=26A216175
- Array t(n,k) = k^(2n)*(k^(2n)-1)*BernoulliB(2n)/(2n), n>=1, k>=2, absolute values read by ascending antidiagonals.at n=26A241066
- Partition array in Abramowitz-Stegun order for the number of ways of putting n stones into a rectangular m X n grid of squares such that each of the m rows contains at least one stone.at n=37A258152
- The first Zagreb index of the Aztec diamond AZ(n) (see the Ramanes et al. reference, Theorem 2.1).at n=37A292344