34671
domain: N
Appears in sequences
- Convolution of Lucas numbers and A000201.at n=16A023621
- Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.at n=50A049020
- Intersection of A065764 and A065765: n such that x and y exist with sigma[x^2] = n = sigma[2*(y^2)].at n=3A065767
- 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, 0, 1), (1, -1, 0), (1, 0, -1)}.at n=12A148020
- Truncated dodecahedron, and truncated icosahedron with faces of centered polygons.at n=10A193248
- Triangle read by rows: T(n,k) = Sum_{j=k..n} binomial(n,j)*Stirling_2(j,k)*Bell(n-j), where Bell(n) = A000110(n), for n >= 1, 0 <= k <= n-1.at n=41A244489
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation Sum_{k=0..n} (k+1)*x^k = Sum_{k=0..n} A_k*(x-3k)^k.at n=17A253383
- Numbers m such that there are precisely 19 groups of order m.at n=18A298910
- Odd numbers m such that sigma(x) = m has more than 1 solution.at n=16A300869
- E.g.f.: exp(exp(x) - 1) * (exp(x) - 1)^5 / 5!.at n=4A346844