35688
domain: N
Appears in sequences
- Number of permutations of length n without modular 3-sequences.at n=8A165960
- Number of partitions of n containing a clique of size 1.at n=40A183558
- Number of non-up-down cycles in all permutations of {1,2,...,n}. A cycle (b(1), b(2), ...) is said to be up-down if, when written with its smallest element in the first position, it satisfies b(1)<b(2)>b(3)<... .at n=8A186362
- Number of partitions of n such that the (sum of distinct odd parts) < n/2.at n=40A284612
- Number of partitions of n such that the (sum of distinct odd parts) <= n/2.at n=40A284613
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^10)).at n=33A288345
- Number of prime parts in the partitions of n into 8 parts.at n=48A309437