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 A245650 #24 Jun 11 2015 11:05:06 %S A245650 31,41,59,67,101,107,139,179,193,199,211,229,239,269,271,281,293,307, %T A245650 313,353,353,353,379,397,409,431,439,449,449,457,467,479,491,499,509, %U A245650 521,547,563,599,607,617,641,659,673,709,719,739,751,761,769,809,811,821,827,859,863,881,883,911,911,919,929 %N A245650 Primes in the sequence 12*n - prime(n), (A245071). %C A245650 As the arithmetic derivative of prime numbers is [prime(n)]' = 1 the comparison of the first arithmetic derivative of (A245071)' = A245649 leads to a selection of 13.386 prime numbers out of 100.000, where some prime numbers are repeated. Remark: The sign of prime(n) here used is +, so prime(n) is distributed relative to 12 = floor(prime(n)/n). %C A245650 Since 12*i - prime(i) < 0 for i > A102281(12) = 40121, this sequence is finite. It has 13386 members, with 1793 distinct primes, the largest being 16369 = a(4713). - _Robert Israel_, Jul 30 2014 %H A245650 Robert Israel, <a href="/A245650/b245650.txt">Table of n, a(n) for n = 1..13386</a>(full sequence) %F A245650 a(n) is the n-th prime member of the sequence 12*i - prime(i). a(n) = prime(n) if (12*i - prime(i)) = prime(n). %p A245650 A:=select(isprime, [seq(12*n - ithprime(n), n=1..40121)]); # _Robert Israel_, Jul 30 2014 %o A245650 (PARI) for(n=1,10^3,q=12*n-prime(n);if(isprime(q),print1(q,", "))) \\ _Derek Orr_, Jul 30 2014 %Y A245650 Cf. A102281, A245071, A245649. %K A245650 nonn,fini,full %O A245650 1,1 %A A245650 _Freimut Marschner_, Jul 30 2014