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.

A103800 Indices n such that A019565(n)-2 is prime.

This page as a plain text file.
%I A103800 #3 Mar 31 2012 10:23:47
%S A103800 4,6,8,10,14,18,20,22,26,28,30,32,34,38,40,42,54,58,60,62,68,76,78,86,
%T A103800 88,98,100,102,106,110,126,128,134,136,138,142,158,162,174,188,190,
%U A103800 194,196,202,210,218,222,230,234,238,240,254,258,260,272,274,278,292,294
%N A103800 Indices n such that A019565(n)-2 is prime.
%e A103800 A019565(0)=1, 1-2=-1 is not prime;
%e A103800 A019565(1)=2, 2-2=0 is not prime;
%e A103800 ...
%e A103800 A019565(4)=5, 5-2=3 is prime, so a(1)=4;
%t A103800 A019565 = Function[tn, k1 = tn; o = 1; tt = 1; While[k1 > 0, k2 = Mod[k1, 2]; If[k2 == 1, tt = tt*Prime[o]]; k1 = (k1 - k2)/2; o = o + 1]; tt]; Do[cp = A019565[n] - 2; If[PrimeQ[cp], Print[n]], {n, 0, 1000}]
%Y A103800 Cf. A019565, A103799.
%K A103800 easy,nonn
%O A103800 1,1
%A A103800 _Lei Zhou_, Feb 22 2005