10450944

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*8^j.at n=30A038262
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*12^j.at n=26A038278
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*7^j.at n=22A038333
• A triangle of coefficients of a Moebius-transformed Pascal triangle as a sum: b(x,y,n)=Sum[Binomial[n,i]*x^i*y^(n-i),{i,0,n}]; transforms: x'->(a1*x + b1)/(c1*x + d1); y'->(a2*y + b2)/(c2*y + d2); b1(x,y,n)=(c1*x + b1)^(k)*(c2*y + d2)^(k)*b(x',y',n); f(x,y,z,n)=b1(x,y,n)+b1(y,z,n)+b1(z,x,n).at n=38A139815
• Number of pairs of vertices that share no common neighbor summed over all simple labeled graphs on n nodes.at n=6A279045
• Number T(n,k) of times the value k appears on the parking functions of length n and such that if we replace that value k with k+1 we don't get a parking function.at n=39A298597
• Number T(n,k) of times the value k appears on the parking functions of length n and such that if we replace that value k with k+1 we don't get a parking function.at n=41A298597
• Integers whose number of divisors that are Zuckerman numbers sets a new record.at n=29A340638
• Triangle read by rows: T(n, k) = floor(binomial(n, k - 1) * (k - 1)^(k - 1) * n * (n - k + 1)^(n - k) / 2).at n=43A369072