Beginning with n, add the next number, subtract the previous number, and so on; then a(n) is the largest prime arising in this process, or 0 if no prime is reached in 2n-1 steps: a(n) is the largest occurring prime in the sum n + (n+1) - (n-1) + (n+2) - (n-2) + (n+3) - (n-3) + ... +- 1 occurring at any stage.
A092951
Beginning with n, add the next number, subtract the previous number, and so on; then a(n) is the largest prime arising in this process, or 0 if no prime is reached in 2n-1 steps: a(n) is the largest occurring prime in the sum n + (n+1) - (n-1) + (n+2) - (n-2) + (n+3) - (n-3) + ... +- 1 occurring at any stage.
Terms
- a(0) =3a(1) =5a(2) =7a(3) =17a(4) =19a(5) =37a(6) =37a(7) =41a(8) =67a(9) =101a(10) =103a(11) =73a(12) =107a(13) =197a(14) =199a(15) =257a(16) =257a(17) =157a(18) =263a(19) =401a(20) =401a(21) =269a(22) =487a(23) =577a(24) =577a(25) =677a(26) =677a(27) =281a(28) =787a(29) =421
External references
- oeis: A092951