43554
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of ternary trees with n edges and such that the first leaf in the preorder traversal is at level k (1<=k<=n). 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=29A121445
- Numbers k such that k * Fibonacci(k) - 1 is prime.at n=22A134580
- Number of ways to place zero or more nonadjacent 1,0 1,1 2,0 3,1 4,1 5,2 6,1 6,2 polyhexes in any orientation on a planar nXnXn triangular grid.at n=8A155422
- Composite squarefree numbers n such that p(i)-6 divides n+6, where p(i) are the prime factors of n.at n=19A225706
- Fourier coefficients of the modular form (1/t_{6a}^3) * (1-12*sqrt(-3) / t_{6a})^(1/6) * F_{6a}^10.at n=32A341566