50320

Appears in sequences

• Number of strict 3rd-order maximal independent sets in cycle graph.at n=50A007392
• Numbers where k-th digit from right is either 0 or k.at n=22A063013
• a(n) is the smallest integer k such that floor((3/2)^k)/floor((3/2)^n) is an integer greater than 1.at n=25A065644
• Long leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=32A089548
• a(n) = (1/12)*(n+1)*(n^3+19*n^2+118*n+228).at n=24A092327
• a(n) = Sum_{k=0..floor(n/2)} binomial(2*n-2*k,2*k)*2^(n-k).at n=8A108485
• Expansion of x^3*(x-1)^2*(x+1) / (x^6-3*x^5+3*x^4-x+1).at n=44A135991
• Solution to the problem of finding the number of comparisons needed for optimal merging of 3 elements with n elements.at n=44A239100
• Sum of all the parts in the partitions of n into 6 parts.at n=37A308867
• Number of ways to tile a 3 X n board with 2 X 2 and 3 X 3 staircase tiles.at n=16A374512
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = 3.at n=13A380924