1048580

Appears in sequences

• Numbers that are the sum of 5 positive 10th powers.at n=21A004805
• a(n) = n^4+4 = (n^2-2*n+2)*(n^2+2*n+2) = ((n-1)^2+1)*((n+1)^2+1).at n=32A057781
• a(n) is the closest number to 2^n which is divisible by n.at n=19A082894
• Triangle read by rows: T(n,k) = n*(1+n^k)/2, 0<=k<=n.at n=42A108396
• a(n) = smallest multiple of n which is >= 2^n.at n=19A128093
• a(n) = 2^n + 4.at n=20A140504
• a(0) = 4; for n >= 1, a(n) = 2^n + 4.at n=20A146528
• Polynomial triangle sequence of coefficients: p(x,n)=-((x - 1)^(2*n + 1)/x^n)*Sum[(k + 1)^n*Binomial[k, n]*x^k, {k, 0, Infinity}]. q(x,n)=(p(x,n)+x^n*p(1/x,n))/2.at n=22A155164
• Polynomial triangle sequence of coefficients: p(x,n)=-((x - 1)^(2*n + 1)/x^n)*Sum[(k + 1)^n*Binomial[k, n]*x^k, {k, 0, Infinity}]. q(x,n)=(p(x,n)+x^n*p(1/x,n))/2.at n=28A155164
• a(n) = n*(n^6 + 1)/2.at n=8A168029
• a(n) = 4^n + 4.at n=10A178675
• Number of n X n symmetric 0..4 arrays with no element equal to the sum mod 5 of all its horizontal and vertical neighbors.at n=3A193611
• a(n) = n^10 + n.at n=4A196292
• 1/4 the number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=38A209723
• Inversion sets of finite permutations that have only 0's and 1's in their inversion vectors.at n=34A211364
• a(n) = 16*n^4 + 4.at n=16A222655
• Numbers that can be represented as both a^x + x and b^y + b, for some a, b, x, y > 1.at n=22A253914
• Number of fundamentally different graceful labelings of the complete tripartite graph K_{1,1,n}.at n=20A339891