Search: id:A014683
Results 1-1 of 1 results found.

%I A014683
%S A014683 1,3,4,4,6,6,8,8,9,10,12,12,14,14,15,16,18,18,20,20,21,22,24,24,25,26,
%T A014683 27,28,30,30,32,32,33,34,35,36,38,38,39,40,42,42,44,44,45,46,48,48,49,
%U A014683 50,51,52,54,54,55,56,57,58,60,60,62,62,63,64,65,66,68,68,69,70,72,72
%N A014683 In the sequence of positive integers add 1 to each prime number.
%C A014683 For n >= 3, a(n) = smallest composite number m such that m - (n-2) is 
               a prime. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com) and Antonio 
               G. Astudillo (afg_astudillo(AT)hotmail.com), Mar 08 2003.
%H A014683 N. J. A. Sloane, <a href="b014683.txt">Table of n, a(n) for n = 1..10000</
               a>
%o A014683 (PARI) a(n)=n+isprime(n)
%Y A014683 Sequence in context: A059179 A061117 A111234 this_sequence A166737 A088847 
               A120613
%Y A014683 Adjacent sequences: A014680 A014681 A014682 this_sequence A014684 A014685 
               A014686
%K A014683 nonn,easy
%O A014683 1,2
%A A014683 Mohammad K. Azarian (ma3(AT)evansville.edu)
%E A014683 More terms from Erich Friedman (erich.friedman(AT)stetson.edu).

Search completed in 0.001 seconds