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 A236676 #19 Nov 06 2024 04:11:46
%S A236676 2,6,8,7,10,13,14,19,23,29,20,37,22,43,47,53,27,61,30,71,73,79,35,89,
%T A236676 97,101,103,107,44,113,46,131,137,139,149,151,54,163,167,173,58,181,
%U A236676 62,193,197,199,66,223,227,229,233,239,75,251,257,263,269,271,82
%N A236676 The n-th term is the n-th composite if n is prime, and the n-th prime if n is not prime.
%C A236676 See A097457 for the (maybe more natural) variant where "n-th composite"(=A002808(n)) is replaced by "n-th nonprime" (=A018252(n)).
%C A236676 Essentially the same as A088608. - _R. J. Mathar_, Feb 03 2014
%H A236676 Harvey P. Dale, <a href="/A236676/b236676.txt">Table of n, a(n) for n = 1..1000</a>
%F A236676 a(n) = A002808(n) if n is prime, a(n) = A000040(n) else.
%t A236676 Module[{nn=100,prs,cmps,len},cmps=Select[Range[nn],CompositeQ];len= Length[ cmps];prs=Prime[Range[len]];Table[If[PrimeQ[n],cmps[[n]],prs[[n]]],{n,len}]] (* _Harvey P. Dale_, Dec 27 2022 *)
%o A236676 (PARI) A236676 = n->if(isprime(n),A002808(n),prime(n))
%Y A236676 Cf. A026234, A236675.
%K A236676 nonn
%O A236676 1,1
%A A236676 _M. F. Hasler_, Jan 29 2014