25897
domain: N
Appears in sequences
- Level of the first leaf (in preorder traversal) of a ternary tree, summed over all ternary trees with n edges. A ternary tree is a rooted tree in which each vertex has at most three children and each child of a vertex is designated as its left or middle or right child.at n=5A121447
- Partial binomial sums of binomial(3n,n)/(2n+1) = A001764(n).at n=7A188687
- Numerator of H(n+4) - H(n), where H(n) = Sum_{k=1..n} 1/k.at n=21A189642
- Numbers k such that the largest prime divisor of k^4+1 is less than k.at n=33A309562
- Square array T(n,k), n >= 1, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding walks in the n X k grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.at n=34A333509
- Number of self-avoiding walks in the n X 3 grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.at n=6A333511
- Triangle read by rows: the numerators of the Lucas triangle.at n=48A385732
- Triangle read by rows: the numerators of the Lucas triangle.at n=51A385732