49637
domain: N
Appears in sequences
- Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) + cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=43A039887
- The sequence S(n,-3,1,1), where S(n,k,t,q) is defined by Sum_{j=0..n} binomial(n+q,j)^t * B(j,k) and B(j,k) is the j-th k-poly-Bernoulli number.at n=5A068518
- Numbers n such that P(13*n) is prime, where P(n) is the unrestricted partition number.at n=30A113518
- First component A of the pairs (A, B), listed in increasing order, such that the multiset of digits of A union the multiset of digits of B equals the multiset of digits of A^2 and the multiset of digits of B^2, for some B >= A. Note that terms may be repeated.at n=14A389379