28336

Appears in sequences

• 4-dimensional pyramidal numbers: a(n) = (3*n+1)*binomial(n+2, 3)/4. Also Stirling2(n+2, n).at n=21A001296
• a(n) = floor(n*(n-1)*(n-2)*(n-3)/9).at n=24A011919
• Triangle of numbers arising from analysis of Levine's sequence A011784.at n=51A014621
• Expansion of g.f. 1/((1-2*x)*(1-6*x)*(1-10*x)).at n=4A016307
• Number of necklaces with 6 black beads and n-6 white beads.at n=26A032191
• a(n) = n*(n+1)*(5*n+1)/6.at n=31A033994
• Triangle of coefficients of generating function of 4-ary rooted trees of height at most n.at n=55A036606
• Number of 4-ary rooted trees with n nodes and height at most 4.at n=24A036609
• Number of 4-ary rooted trees with n nodes and height exactly 4.at n=24A036628
• Maximization of sums of cubes of integer differences (b_[ i ]-i)^3 over permutations {b_[ i ], for i-1,2,...,n} on first n integers.at n=29A049031
• Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_24.at n=7A055751
• Generalized sum of divisors function: third diagonal of A060047.at n=38A060046
• Sequence resulting from a sum of three repeated binomial(n+3,4) sequences.at n=40A093039
• Number of ways to change three non-identical letters in the word aabbccdd..., where there are n types of letters.at n=21A102860
• Triangular product sequence based 2^n times the Fibonacci version and 4 replaced with m: t(m,n)=2^n*Product[(1 + m*Cos[k*Pi/n]^2), {k, 1, Floor[(n - 1)/2]}].at n=53A152036
• Number of (n+1)X(6+1) 0..2 arrays with the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=8A237635
• a(n)=sum_{j=0..n} sum_{i=0..j} F(i)*L(j), where F(n)=A000045(n) and L(n)=A000032(n).at n=10A242496
• Number of series-reduced locally non-intersecting aperiodic rooted trees with n nodes.at n=20A319271
• a(n) = 1 + F(2*n+1) - (F(n+4) - (-1)^n*F(n-2))/2 where F=A000045.at n=11A330051
• For 1<=x<=n, 1<=y<=n with gcd(x,y)=1, write 1 = gcd(x,y) = u*x+v*y with u,v minimal; a(n) = m^2*s, where s is the population variance of the values of u^2+v^2 and m is the number of such values.at n=7A345696