44930
domain: N
Appears in sequences
- Smallest even k such that lpf(k-1) = prime(n), while lpf(k-3) > prime(n), where lpf=least prime factor (A020639).at n=39A242489
- Number of self-avoiding closed paths on an n X n grid which pass through four corners ((0,0), (0,n-1), (n-1,n-1), (n-1,0)).at n=4A333466
- Square array T(n,k), n >= 2, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding closed paths on an n X k grid which pass through four corners ((0,0), (0,k-1), (n-1,k-1), (n-1,0)).at n=40A333513
- Number of self-avoiding closed paths on an n X 6 grid which pass through four corners ((0,0), (0,5), (n-1,5), (n-1,0)).at n=4A358712
- a(n) is the index where A387090(n) appears in A386482.at n=35A386484