31564
domain: N
Appears in sequences
- Engel expansion of Sum_{k>=0} 1/(8 + k)^k.at n=12A063191
- Number of permutations of 0..n-1 with all sums of 2 through 4 adjacent terms squared respectively unique.at n=7A147733
- Number of permutations of 0..n-1 with all sums of 2 through 5 adjacent terms squared respectively unique.at n=7A147734
- Number of permutations of 0..n-1 with all sums of 2 through 6 adjacent terms squared respectively unique.at n=7A147735
- Number of binary strings of length n with no substrings equal to 000, 010, or 111.at n=47A164317
- Number of binary strings of length n with no substrings equal to 0001, 0110, or 1110.at n=30A164482
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 185", based on the 5-celled von Neumann neighborhood.at n=34A270636
- Triangle read by rows: T(n,k) is the number of normal sequences of length n whose standard factorization into Lyndon words (aperiodic necklaces) has k factors.at n=32A296372
- Numerators of convergents to continued fraction expansion of tribonacci constant (A058265, A019712).at n=5A319428
- Number of compositions of n where the difference between largest and smallest parts equals six.at n=14A323123
- Number of ternary length-2 squarefree words of length n not containing the subwords 021 or 10.at n=24A373554