Least number of steps required in 2D prime walk for it to cross itself n times.

A268463

Least number of steps required in 2D prime walk for it to cross itself n times.

Terms

    a(0) =1a(1) =15a(2) =35a(3) =47a(4) =81a(5) =7087a(6) =7399a(7) =19865a(8) =19913a(9) =24087a(10) =24279a(11) =408257a(12) =409303a(13) =2042205a(14) =5262017a(15) =5262089a(16) =6189393a(17) =6435851a(18) =6435983a(19) =64318033a(20) =64323297a(21) =64346653a(22) =188012449a(23) =6526836309

External references