24284

Appears in sequences

• Number of Greg trees with n black nodes.at n=11A052302
• Number of + signs needed to write the partitions of n (A000041) as sums.at n=27A076276
• a(n) = 36*n^2 - 2*n.at n=25A158062
• Number of permutations of 1..n with all differences of elements separated by distances 1 through 5 being respectively unique.at n=13A170811
• Numerators of convergents to the general continued fraction 1/(1 + 2/(1 + 3/(1 + 4/(1+ ...)))).at n=11A225435
• Row sums of triangle A166884.at n=6A229112
• Number of (n+1) X (3+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=8A234261
• a(n) is the number of sets modulo n which can be formed by a finite arithmetic sequence.at n=43A331503