34544

Appears in sequences

• Expansion of e.g.f. (1 + x)^x.at n=8A007113
• Stanley's children's game. Class of n (named) children forms into rings with exactly one child inside each ring. We allow the case when outer ring has only one child. a(n) gives number of possibilities, including clockwise order (or which hand is held), in each ring.at n=6A066166
• Numbers k such that phi(k) = Sum_{d|k} core(d) where core(x) is the squarefree part of x (A007913).at n=17A074786
• Number of isomorphism classes of non-associative non-commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n, listed by class size.at n=13A079202
• Index k of the least colossally abundant number c=A004490(k) with sigma(c)/c >= n.at n=21A110443
• Sum of horizontal positions of the first peak in all bargraphs of semiperimeter n.at n=11A277973
• Numbers k such that k and k+1 are both phi-practical numbers (A260653).at n=38A330871
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 + x)^(x^k).at n=53A355607
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 - x)^(-x^k).at n=53A355609
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 - x)^(-x^k/k!).at n=53A355610
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 + x)^(x^k/k!).at n=53A355619
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)^n * n! * Sum_{j=0..floor(n/2)} k^j * Stirling1(n-j,j)/(n-j)!.at n=53A362834
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)^n * n! * Sum_{j=0..floor(n/2)} k^(n-j) * Stirling1(n-j,j)/(n-j)!.at n=53A362837
• Numbers k such that sigma(k) = psi(k) + phi(k).at n=14A389478