36438
domain: N
Appears in sequences
- 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, 1), (-1, 0, 1), (-1, 1, -1), (0, 1, -1), (1, 0, 0)}.at n=11A148144
- a(n) = prime(n)^2 - n.at n=42A182174
- Number of partitions of n into two sorts of parts having exactly 6 parts of the second sort.at n=10A258476
- G.f. A(x) satisfies: A(x - A(x^2)) = x + 2*A(x^2).at n=8A295761
- Number of odd p-trees of weight n (all proper terminal subtrees have odd weight).at n=22A300436
- Number of p-trees of weight 2n + 1 in which all outdegrees are odd.at n=11A318485
- a(n) = floor(b(n)), where b(1) = 1 and b(n) = b(n-1) + Sum_{k=1..n-1} b(k)/(n-1).at n=43A376995