The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A104994 Least k(n)>1 such that n*(k(n)^2)+n*k(n)+1 is a prime > (n-1)*((k(n-1)^2)+(n-1)*k(n-1)+1 or 0 if n=4 as no prime possible. 1

%I

%S 2,2,2,0,2,2,2,3,3,6,6,7,8,8,12,14,14,19,21,21,22,27,27,28,29,29,30,

%T 30,34,37,38,39,39,41,41,43,50,52,54,54,56

%N Least k(n)>1 such that n*(k(n)^2)+n*k(n)+1 is a prime > (n-1)*((k(n-1)^2)+(n-1)*k(n-1)+1 or 0 if n=4 as no prime possible.

%C sequence of the primes given in A104995

%e 1*2^2+1*2+1=7 prime so k(1)=2

%e 2*2^2+2*2+1=13 prime > 7 so k(2)=2

%e 3*2^2+3*2+1=19 prime > 13 so k(3)=2

%e 5*2^2+5*2+1=31 prime > 19 so k(5)=2

%Y Cf. A104995.

%K nonn

%O 1,1

%A _Pierre CAMI_, Mar 31 2005

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

Last modified October 30 06:31 EDT 2020. Contains 338077 sequences. (Running on oeis4.)