32330

Appears in sequences

• Number of partitions into non-integral powers.at n=23A000339
• Number of partitions of n with equal nonzero number of parts congruent to each of 3 and 4 (mod 5).at n=51A035571
• a(n) = 2*n^4 + 2*n^3 + 3*n^2 + 2*n + 1.at n=11A058920
• Number of binary strings of length n with equal numbers of 00100 and 10101 substrings.at n=16A164242
• Number of circular permutations of length n without increasing or decreasing 3-sequences.at n=8A165964
• Number of permutations of 1..n with displacements restricted to {-4,-1,0,2,3}.at n=14A189582
• a(1)=2, a(2)=5, a(n)=2*a(n-1) + 5*a(n-2).at n=8A189734
• Number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) having only ascents of even length (an ascent is a maximal sequence of consecutive (1,1)-steps).at n=27A191321
• Numbers k such that 4^k + 15 is prime.at n=35A253773
• G.f.: (1 + x^4 + x^5 + x^6 + x^10 + x^11 + x^12 + x^16)/Product_{i=1..8} (1 - x^i).at n=40A256975
• Expansion of Product_{k>=1} (1 - p(k)*x^k), where p(k) = number of partitions of k (A000041).at n=26A304785
• Numbers k such that k + A224787(k) is a square.at n=15A386640