29886

Appears in sequences

• Simple zero-divisors of Cayley-Dickson algebras.at n=8A167654
• G.f.: exp( Sum_{n>=1} A001511(n)*2^A001511(n)*x^n/n ) where A001511(n) equals the 2-adic valuation of 2n.at n=22A183036
• Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 7.at n=53A245147
• Number T(n,k) of length 3n words such that all letters of the k-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples of identical letters into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=24A256311
• Number of words of length 3n such that all letters of the ternary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples into the initially empty word.at n=3A321033
• Number of words of length 6n such that all letters of the n-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples of identical letters into the initially empty word.at n=3A321041