89131
domain: N
Appears in sequences
- a(1) = 1; for n > 1, a(n) is the least k > a(n-1) such that a(n) + a(n-1) is square and a(n) - a(n-1) is prime.at n=39A108972
- Number of all self-avoiding planar walks of length j (0<=j<=n) starting at (0,0), ending at (n-j,0), remaining in the first quadrant and using steps (0,1), (1,0), (1,1), (-1,1), and (1,-1) with the restriction that (0,1) is never used below the diagonal and (1,0) is never used above the diagonal.at n=23A284428