1916928
domain: N
Appears in sequences
- G.f. satisfies: A(x) = exp( Sum_{n>=1} [Sum_{k=0..2*n} A200536(n,k)^2 * x^k] / A(x)^n * x^n/n ), where A200536(n,k) is the coefficient of x^k in (1+3*x+2*x^2)^n.at n=28A200537
- G.f. satisfies: A(x) = exp( Sum_{n>=1} [Sum_{k=0..2*n} A200536(n,2*n-k)^2 * x^k] / A(x)^n * x^n/n ), where A200536(n,2*n-k) is the coefficient of x^k in (2+3*x+x^2)^n.at n=28A251689
- Numbers k such that sum of odd divisors of k equals sum of squares of primes dividing k.at n=30A252424
- a(n) = n*A004141(n).at n=8A259868
- Number of permutations of n elements divided by the number of ternary heaps on n+1 elements.at n=29A273731
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 262", based on the 5-celled von Neumann neighborhood.at n=20A287291
- Nonprime Heinz numbers of integer partitions whose product is equal to their sum.at n=29A301988
- Number of (undirected) Hamiltonian paths in the 2n-crossed prism graph.at n=10A308136
- Triangle T(n,k) read by rows in which n-th row lists in increasing order all multiplicative partitions mu of n whose sum is also n (with factors >= 1), encoded as Product_{j in mu} prime(j); n>=1, 1<=k<=A001055(n).at n=50A377852