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.

A144419 Primes of the form prime(k) - 2*k (terms can be repeated).

This page as a plain text file.
%I A144419 #22 Nov 24 2024 03:38:07
%S A144419 3,3,5,13,17,29,31,31,37,41,47,53,67,71,71,79,79,83,89,97,97,107,107,
%T A144419 127,131,151,181,197,211,229,241,257,257,269,271,281,283,283,311,353,
%U A144419 373,389,401,409,409,419,419,431,449,463,479,491,499,547,563,577,577
%N A144419 Primes of the form prime(k) - 2*k (terms can be repeated).
%H A144419 Robert Israel, <a href="/A144419/b144419.txt">Table of n, a(n) for n = 1..10000</a>
%e A144419 For k=7,  prime(7)  - 2*7  = 17 - 14 =  3 = a(1).
%e A144419 For k=8,  prime(8)  - 2*8  =  9 - 16 =  3 = a(2).
%e A144419 For k=9,  prime(9)  - 2*9  = 23 - 18 =  5 = a(3).
%e A144419 For k=12, prime(12) - 2*12 = 37 - 24 = 13 = a(4).
%e A144419 For k=15, prime(15) - 2*15 = 47 - 30 = 17 = a(5).
%e A144419 For k=19, prime(19) - 2*19 = 67 - 38 = 29 = a(6).
%e A144419 For k=20, prime(20) - 2*20 = 71 - 40 = 31 = a(7).
%p A144419 select(isprime, [seq(ithprime(k)-2*k,k=1..1000)]); # _Robert Israel_, Nov 24 2024
%Y A144419 Cf. A000040, A179437.
%K A144419 nonn
%O A144419 1,1
%A A144419 _Juri-Stepan Gerasimov_, Oct 07 2008
%E A144419 A 181 replaced with 281 by _R. J. Mathar_, Apr 14 2010