67171

Appears in sequences

• Sum of 6th powers: 0^6 + 1^6 + 2^6 + ... + n^6.at n=6A000540
• a(n) = 1^n + 2^n + ... + 6^n.at n=6A001553
• a(n) = Sum_{k=1..n} k^n.at n=5A031971
• Numerator of L(n) = (Sum_{k=1..n} k^n)/(Sum_{k=1..n-1} k^n).at n=4A043299
• Numbers n such that the smallest possible number of multiplications required to compute x^n is by 2 less than the number of multiplications obtained by Knuth's power tree method.at n=10A115614
• Triangle of sums of the first k n-th powers multiplied by binomial(n,k), read by rows.at n=27A215078
• Triangle T(n,k) = sum of the k first n-th powers.at n=27A215083
• Numbers which are the sums of consecutive sixth powers.at n=21A217846
• Number of n X n 0..1 arrays with no more than floor(n X n/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order.at n=5A222352
• Number of nX6 0..1 arrays with no more than floor(nX6/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order.at n=5A222358
• T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order.at n=60A222360
• Sum of first (prime(n) - 1) (prime(n) - 1)th powers.at n=3A225578
• Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and with no two consecutive increases.at n=24A263637
• Sum of the sixth powers of the parts in the partitions of n into two parts.at n=6A294273
• Sum of the sixth powers of the parts in the partitions of n into two distinct parts.at n=6A294301
• Partial sums of A299281.at n=35A299282
• Array read by ascending antidiagonals: A(n, k) = HurwitzZeta(-n, k) - HurwitzZeta(-n, k+n) with k >= 0.at n=29A391310