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.

A182483 a(n) is the least m such that A182482(m) = A001359(n), the n-th twin prime.

This page as a plain text file.
%I A182483 #20 Sep 17 2019 16:08:06
%S A182483 1,2,3,5,7,10,4,17,9,23,25,15,8,11,19,20,45,47,13,29,14,24,77,87,95,
%T A182483 50,103,107,22,27,137,46,143,21,34,43,175,59,91,48,41,71,215,31,44,
%U A182483 119,121,247,62,67,54,139,283,287,149,39,313,161,65,37,169,347,116
%N A182483 a(n) is the least m such that A182482(m) = A001359(n), the n-th twin prime.
%C A182483 a(n) exists for every n>=2.
%H A182483 Ray Chandler, <a href="/A182483/b182483.txt">Table of n, a(n) for n = 2..10001</a>
%t A182483 t = Table[k = 0; While[p = 6*k*n - 1; ! (PrimeQ[p] && PrimeQ[p + 2]), k++]; p, {n, 1000}]; tp = Select[Prime[Range[1000]], PrimeQ[# + 2] &]; t2 = {}; found = True; n = 2; While[found, pos = Position[t, tp[[n]], 1, 1]; If[pos == {}, found = False, AppendTo[t2, pos[[1, 1]]]; n++]]; t2 (* _T. D. Noe_, May 02 2012 *)
%Y A182483 Cf. A182481, A182482, A001359, A006512, A014574, A001097, A077800, A002822.
%K A182483 nonn
%O A182483 2,2
%A A182483 _Vladimir Shevelev_, May 01 2012