823,543 The pattern is n to the nth power.
1 to the first power, 2 to the second power, 3 to the third power, 4 to the fourth power, 5 to the fifth power...
Multiply by 4
256
3125, 46656 This is the sequence I used: * 1 = 11 * 4 = 22 * 27 = 33 * 256 = 44 * 3125 = 55 * 46,656 = 66 * and so on...
11 = 1 22 = 4 33 = 27 44 = 256 55 = 3125
823,543 The pattern is n to the nth power.
1 to the first power, 2 to the second power, 3 to the third power, 4 to the fourth power, 5 to the fifth 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
44 = 256
int main (void) { puts ("1 4 27 256 3125"); return 0; }
Multiply by 4
256
3125, 46656 This is the sequence I used: * 1 = 11 * 4 = 22 * 27 = 33 * 256 = 44 * 3125 = 55 * 46,656 = 66 * and so on...
27
256
A sequence of squares: n to the nth power