76050

Appears in sequences

• a(n) = n^2*(n^2 - 1)/6.at n=26A008911
• Numbers that are the sum of 2 nonzero squares in exactly 5 ways.at n=30A025288
• Eighth column of quintinomial coefficients.at n=12A064057
• Initial values for f(x)=phi(sigma(x)) such that iteration of f ends in cycle of length=11.at n=0A096888
• Numbers n that are the hypotenuse of exactly 12 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 12 ways.at n=28A097226
• Non-deficient numbers with odd sigma such that the sum of the even divisors is twice the sum of the odd divisors.at n=36A171642
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-3.at n=22A180293
• Number of fixed polypons with n cells (division into triangles is significant).at n=15A196993
• Values of the difference d for 6 primes in geometric-arithmetic progression with the minimal sequence {7*7^j + j*d}, j = 0 to 5.at n=32A209205
• Values of the difference d for 7 primes in geometric-arithmetic progression with the minimal sequence {7*7^j + j*d}, j = 0 to 6.at n=7A209206
• Number of length 5+2 0..n arrays with some pair in every consecutive three terms totalling exactly n.at n=8A245874
• a(n) = Product_{d|n, d>1} prime(A286622(d)-1).at n=29A305794
• a(n) = Product_{d|n, d>1} prime(A318881(d)), where A318881(d) records the prime signature of A000010(d).at n=29A319344
• Number of maximal matchings in the n-triangular honeycomb acute knight graph.at n=6A321486
• a(n) is the smallest number which can be represented as the sum of n distinct centered n-gonal numbers in exactly n ways, or -1 if no such number exists.at n=22A352975