Number of self-avoiding walks on a 2-dimensional square lattice where the walk consists of steps with incrementing lengths equal to the prime numbers, from 2 to prime(n).
A336262
Number of self-avoiding walks on a 2-dimensional square lattice where the walk consists of steps with incrementing lengths equal to the prime numbers, from 2 to prime(n).
Terms
- a(0) =1a(1) =4a(2) =12a(3) =36a(4) =108a(5) =324a(6) =972a(7) =2876a(8) =8364a(9) =24124a(10) =69116a(11) =196916a(12) =559604a(13) =1585764a(14) =4495740a(15) =12714796a(16) =35654620a(17) =99686708a(18) =278880060a(19) =781504972a(20) =2180418716a(21) =6079373324a(22) =16857930068a(23) =46773551052a(24) =129562831140a(25) =358157148332
External references
- oeis: A336262