32079
domain: N
Appears in sequences
- If m = p_i^e_i, n=Product p_j^f_j, set G_m(n) = Product p_{j+i}^{f_j*e_i}; extend G_m to all m by multiplicativity; sequence gives a(n)=G_n(n).at n=25A045974
- Closed walks of length n along the edges of a dodecahedron based at a vertex.at n=12A054882
- Sum of largest parts (counted with multiplicity) of all partitions of n.at n=27A092321
- Numbers k such that k and 2*k, taken together are pandigital.at n=28A115922
- Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 2.at n=22A245142
- Number T(n,k) of permutations p of [n] having at least one index i with |p(i)-i| = k; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows.at n=30A306506
- Number of permutations p of [n] having at least one index i with |p(i)-i| = 2.at n=8A306524
- 1/(Integral_{x=0..1} x^(x^(x^n)) dx - 1/2), rounded to the nearest integer.at n=38A322009