256
823,543 The pattern is n to the nth power.
The number is 27. (33) The sequence shows the lowest 7 nonzero values for the exponential series nn, i.e. 1 to the first power, 2 to the 2nd power, up to 7 to the 7th power. 1*1=1 2*2=4 3*3*3=27 4*4*4*4=256 5*5*5*5*5=3125 6*6*6*6*6*6=46656 7*7*7*7*7*7*7=823543
46656 as it is 6 to the power of 6. Each in turn is the result of a number to the power of itself.
3125, 46656 This is the sequence I used: * 1 = 11 * 4 = 22 * 27 = 33 * 256 = 44 * 3125 = 55 * 46,656 = 66 * and so on...
44 = 256
256
823,543 The pattern is n to the nth power.
missing number is 256 1, 4, 27, 256, 3,125 then 46,656, 823,543 and so on ... 1¹ = 1 2² = 2 x 2 = 4 3³ = 3 x 3 x 3 = 27 so 4 x 4 x 4 x 4 = 16 x 16 = 36 + 60 + 160 = 256
27
11 = 1 22 = 4 33 = 27 44 = 256 55 = 3125
312511 = 122 = 433 = 2744 = 25655 = 3125
The missing number is 18
int main (void) { puts ("1 4 27 256 3125"); return 0; }
The number is 27. (33) The sequence shows the lowest 7 nonzero values for the exponential series nn, i.e. 1 to the first power, 2 to the 2nd power, up to 7 to the 7th power. 1*1=1 2*2=4 3*3*3=27 4*4*4*4=256 5*5*5*5*5=3125 6*6*6*6*6*6=46656 7*7*7*7*7*7*7=823543
64 It is a series of cubes 13, 23, 33, 43, 53 etc
46656 as it is 6 to the power of 6. Each in turn is the result of a number to the power of itself.