This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A362466 #40 Jul 10 2023 18:47:32 %S A362466 1,0,3,29,-1,521,-1,31751,-1,47973321,-1 %N A362466 First occurrence of n in A362465 or -1 if n is not a term in A362465. %C A362466 All terms a(n) for even n > 4 are conjectures and conjectured to be -1. This follows from the reason derived from Polignac's conjecture that is described in A362465. %C A362466 The requirements for the truth of the above conjecture about this sequence seem to be notably weaker than for Polignac's conjecture. %e A362466 a(5) = 29 because it is the least number that cannot be expressed as a sum of more than 1 and fewer than 5 consecutive signed primes. The example in A362465 shows that there is a solution for 29 with 5 consecutive signed primes, but not with more than 1 and fewer than 5. %Y A362466 Cf. A362465. %K A362466 more,sign %O A362466 2,3 %A A362466 _Karl-Heinz Hofmann_ and _Peter Munn_, Apr 24 2023