cp's OEIS Frontend

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.

A057473 Let prime(i) = i-th prime, let twin(n) = (P,Q) be n-th pair of twin primes; sequence gives prime(Q).

This page as a plain text file.
%I A057473 #20 Jul 02 2025 16:02:00
%S A057473 11,17,41,67,127,191,283,367,563,599,797,877,1087,1171,1217,1447,1523,
%T A057473 1741,1847,2081,2351,2909,3019,3299,3761,4153,4421,4567,4787,4943,
%U A057473 6229,6323,6361,6661,6863,8117,8233,8389,8527,8761,9319,10009,10457,10589
%N A057473 Let prime(i) = i-th prime, let twin(n) = (P,Q) be n-th pair of twin primes; sequence gives prime(Q).
%H A057473 Amiram Eldar, <a href="/A057473/b057473.txt">Table of n, a(n) for n = 1..10000</a>
%F A057473 From _Amiram Eldar_, Feb 14 2025: (Start)
%F A057473 a(n) = prime(A006512(n)).
%F A057473 a(n) = A151800(A151800(A057470(n))). (End)
%e A057473 The 3rd pair of twin primes is twin(3) = (11,13), so a(3) = prime(13) = 41.
%t A057473 Prime[#]&/@Transpose[Select[Partition[Prime[Range[300]],2,1], Last[#]- First[#] == 2&]][[2]] (* _Harvey P. Dale_, Nov 29 2011 *)
%Y A057473 Cf. A006512, A057470, A151800.
%K A057473 nonn,less
%O A057473 1,1
%A A057473 _James Sellers_, Sep 11 2000