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 A345966 #21 Mar 24 2025 06:03:50 %S A345966 1,3,2,5,6,4,8,7,10,11,12,9,13,16,14,18,15,17,20,19,22,23,24,21,25,26, %T A345966 28,27,29,30,32,31,36,33,35,34,38,37,42,39,41,48,40,44,43,46,45,47,50, %U A345966 49,51,53,54,52,56,55,57,58,59,68,60,61,66,62,63,65,64,69,67,70,71,78,72,73,76,74,79,84,75,77 %N A345966 The succession of nonprime and prime terms is kept when you consider the sequence formed by the successive sums a(n) + a(n+1). This is the lexicographically earliest sequence of distinct positive terms with this property. %C A345966 Here is the succession of nonprimes and primes in the sequence: %C A345966 1, 3, 2, 5, 6, 4, 8, 7, 10, 11, 12, 9, 13, 16, 14, 18, 15, %C A345966 n p p p n n n p n p n n p n n n n %C A345966 The same succession is formed by a(n) + a(n+1): %C A345966 4, 5, 7, 11, 10, 12, 15, 17, 21, 23, 21, 22, 29, 30, 32, 33, 32 %C A345966 n p p p n n n p n p n n p n n n n %H A345966 Dominic McCarty, <a href="/A345966/b345966.txt">Table of n, a(n) for n = 1..10000</a> %t A345966 seq[n_] := Module[{s = {1}, q, k}, Do[q = PrimeQ[s[[-1]]]; k = 1; While[!FreeQ[s, k] || PrimeQ[s[[-1]] + k] != q, k++]; AppendTo[s, k], {n}]; s]; seq[100] (* _Amiram Eldar_, Jun 30 2021 *) %Y A345966 Cf. A094044, A345903. %K A345966 nonn %O A345966 1,2 %A A345966 _Eric Angelini_ and _Carole Dubois_, Jun 30 2021