23258
domain: N
Appears in sequences
- a(n) is the number whose base-2 representation is d(0)d(1)...d(n), where d=A005614 (the infinite Fibonacci word).at n=14A044432
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only either as two by three or three by two blocks.at n=22A146157
- G.f.: exp( Sum_{n>=1} x^n/n * Product_{d|n} (1 + d*x^n)^d ).at n=23A205482
- Number of 4 X n 0..2 arrays with no element equal to the sum of elements to its left or one plus the sum of the elements above it, modulo 3.at n=22A239031
- Number of set partitions of [n] having exactly seven pairs (m,m+1) such that m+1 is in some block b and m is in block b+1.at n=2A270961
- Number of set partitions of [2n] having exactly n pairs (m,m+1) such that m+1 is in some block b and m is in block b+1.at n=7A270965
- Number of inequivalent colorings of free pure symmetric multifunctions (with empty expressions allowed) with n positions.at n=8A300626
- Numbers m such that the product of m and the string m in reverse contains m as a substring.at n=34A342127