22461

Appears in sequences

• a(1)=1, a(n) = n*5^(n-1) + a(n-1).at n=5A014917
• Integers k such that nextprime(k^5) - prevprime(k^5) = 4.at n=19A090123
• Triangle read by rows, generated from (..., 3, 2, 1).at n=50A108283
• a(n) = 1 + 2*n + 3*n^2 + 4*n^3 + 5*n^4 + 6*n^5.at n=5A113531
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, -1), (1, -1, -1), (1, 1, 1)}.at n=9A149498
• Number of ways to place zero or more nonadjacent 0,0 1,0 1,1 2,0 3,0 3,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155257
• a(n) = Sum_{i=0..n} (i+1)*n^i.at n=5A189001
• Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,0,1,2,3 for x=0,1,2,3,4.at n=6A196680
• Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,0,1,2,3 for x=0,1,2,3,4.at n=2A196684
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,0,1,2,3 for x=0,1,2,3,4.at n=38A196685
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,0,1,2,3 for x=0,1,2,3,4.at n=42A196685
• a(0)=0, a(1)=1, a(n) = min{5 a(k) + (5^(n-k)-1)/4, k=0..(n-1)} for n>=2.at n=21A259669
• a(n) is the smallest error in trying to solve n^5 = x^5 + y^5: for each n from 2 on, find positive integers x and y, x <= y < n such that |n^5 - x^5 - y^5| is minimal and let a(n) = n^5 - x^5 - y^5. In case of a tie, choose the solution with smallest y.at n=11A369855