The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A144423 Primes of the form (p(n)-2*(n-1))/11, where p(n)=n-th prime. 1

%I #5 Sep 28 2013 16:20:31

%S 3,3,5,17,41,59,71,73,79,89,89,107,127,163,173,227,227,233,233,241,

%T 271,283,331,331,337,373,379,379,383,419,443,443,461,487,503,557,563,

%U 571,577,617,619,631,659,677,683,709,709,733,769,769,823,859,887,919,997

%N Primes of the form (p(n)-2*(n-1))/11, where p(n)=n-th prime.

%H Harvey P. Dale, <a href="/A144423/b144423.txt">Table of n, a(n) for n = 1..1000</a>

%e If n=20, then (p(20)-2*(20-1))/11=(71-38)/11=3=a(1).

%e If n=21, then (p(21)-2*(21-1))/11=(73-40)/11=3=a(2).

%e If n=30, then (p(30)-2*(30-1))/11=(113-58)/11=5=a(3).

%e If n=126, then (p(126)-2*(126-1))/11=(701-250)/11=41=a(4).

%e If n=165, then (p(165)-2*(165-1))/11=(977-328)/11=59=a(5).

%e If n=192, then (p(192)-2*(192-1))/11=(1163-382)/11=71=a(6), etc.

%t Select[Table[(Prime[n]-2(n-1))/11,{n,2000}],PrimeQ] (* _Harvey P. Dale_, Sep 28 2013 *)

%Y Cf. A000040.

%K nonn

%O 1,1

%A _Juri-Stepan Gerasimov_, Oct 08 2008

%E 17, 73, 89, 107 inserted and extended by _R. J. Mathar_, Nov 06 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 20 21:09 EDT 2024. Contains 373532 sequences. (Running on oeis4.)