Benchmark: Math.pow(2,n) vs Table lookup?

Script Preparation code:

var POWERS = [
		1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,
		65536,131072,262144,524288,1048576,2097152
		
];

Tests:

Table lookup
let p = 15; let x; if (p > 20) { x = Math.pow(2,p); } else { x = POWERS[20]; }
Math.pow
let p = 15; let x; x = Math.pow(2,p);

Rendered benchmark preparation results:

Previous results

Test case name	Result
Table lookup
Math.pow

Latest run results:

Run details: (Test run date: 8 months ago)

User agent: Mozilla/5.0 (Linux; Android 10; K) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/139.0.0.0 Mobile Safari/537.36

Browser/OS: Chrome Mobile 139 on Android

Test name	Executions per second
Table lookup	75216416.0 Ops/sec
Math.pow	80905760.0 Ops/sec

Related benchmarks:

Math.pow(2,n) vs Table lookup? (version: 6)