113610

Appears in sequences

• a(n) is the number of labeled rooted trees on a set of size n where each node has at most 3 neighbors that are further away from the root than the node itself.at n=7A036775
• Theta series of 14-dimensional lattice C2 X S7 with minimal norm 4.at n=6A047633
• Numbers k such that phi(k+1) = 4*phi(k).at n=6A172314
• Square array whose entry A(n,k) is the number of labeled rooted trees on a set of size n where each node has at most k neighbors that are further away from the root than the node itself, for n >= 0, k >= 0, read by descending antidiagonals.at n=62A325201
• a(n) is the number of words of length n over the alphabet {a,b,c} with an even number of appearances of the letter 'a' and the sum of appearances of the letters 'b' and 'c' add up to at most 3.at n=45A341896