36879
domain: N
Appears in sequences
- Partial sums of A000337(n+4), n >= 0.at n=10A045618
- a(n) is the number of ways the set {1^3, 2^3, ..., n^3} can be partitioned into two sets of equal sums.at n=31A113263
- Triangle of numbers related to the generalized Catalan sequence C(2;n+1)=A064062(n+1), n>=0.at n=33A113647
- A sequence related to Catalan numbers A000108.at n=7A115138
- Third diagonal (M=3) sequence of triangle A113647, called Y(2,1).at n=5A115150
- Number of 1..3 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=9A171277
- Number of 1..n integer arrays v[1..10] of length 10 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..9.at n=2A171347
- Number of partitions of n such that 5*(greatest part) >= (number of parts).at n=39A347869
- Least k such that A359247(k) = n, or 0 if no such k exists.at n=26A359657