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 A061068 #42 Jul 15 2024 15:11:00
%S A061068 3,5,11,19,79,101,113,127,163,173,223,271,383,419,431,503,571,599,619,
%T A061068 641,659,673,683,701,733,757,827,863,971,1013,1033,1087,1193,1249,
%U A061068 1423,1433,1453,1483,1579,1621,1667,1723,2003,2113,2179,2287,2381,2459,2467
%N A061068 Primes which are the sum of a prime and its subscript.
%C A061068 a(n) = A061067(n-1) + A064402(n). - _Leroy Quet_, Jun 30 2006
%C A061068 This sequence is the intersection of A014688 with the set of primes. Conjecture: this sequence is infinite, yet derives from arbitrarily long "prime deserts" such as the 11 composites in A014688 between a(6) = 19 and a(18) = 79 and the 17 composites in A014688 between a(48) = 271 and a(66) = 383. - _Jonathan Vos Post_, Nov 22 2004
%C A061068 Primes not of the form n + pi(n-1). - _Thomas Ordowski_, Sep 21 2013
%C A061068 Except for the first pair (3, 5) no two consecutive primes are terms of the sequence. - _Zak Seidov_, Nov 10 2013
%H A061068 T. D. Noe, <a href="/A061068/b061068.txt">Table of n, a(n) for n=1..1000</a>
%e A061068 5th term is 79=61+18=prime(18)+18.
%t A061068 Select[Range[500], PrimeQ[Prime[ # ] + # ] &] + Prime[Select[Range[500], PrimeQ[Prime[ # ] + # ] &]] (* _Stefan Steinerberger_, Jul 21 2006 *)
%o A061068 (PARI) { n=0; m=0; forprime (p=2, 109567, if (isprime(p + m++), write("b061068.txt", n++, " ", p + m)) ) } \\ _Harry J. Smith_, Jul 17 2009
%Y A061068 Cf. A061067, A064402.
%K A061068 nonn
%O A061068 1,1
%A A061068 _Labos Elemer_, May 28 2001
%E A061068 Edited by _N. J. A. Sloane_, Apr 29 2007
%E A061068 Definition clarified by _Jonathan Sondow_, Jul 12 2012