login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115366 a(n) = the number of values of k <= 10^n such that sqrt(k*(k+1)*(k+2)*(k+3)+1)) is prime. 0
1, 9, 50, 313, 2188, 17075, 139484, 1179766, 10220078, 90159466 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

sqrt(k*(k+1)*(k+2)*(k+3)+1) = k^2 + 3*k + 1.

a(n)/A006880(n) ~= 1.78, 1.78, 1.7769, 1.7752, 1.7738, 1.7731. Conjecture: a(n)/A006880(n) -> 1.77...

LINKS

Table of n, a(n) for n=1..10.

MATHEMATICA

c = 0; k = 1; Do[ While[k <= 10^n, If[ PrimeQ@ Round@ Sqrt[k(k + 1)(k + 2)(k + 3) + 1], c++ ]; k++ ]; Print@c, {n, 0, 9}] (* Robert G. Wilson v, May 01 2006 *)

PROG

(PARI) g(n)= { for(j=0, n, c=0; for(x=0, 10^j, y=round(sqrt(x*(x+1)*(x+2)*(x+3)+1)); if(ispseudoprime(y), c++)); print1(c", ") ) }

CROSSREFS

Cf. A006880.

Sequence in context: A231413 A007681 A279972 * A188210 A221246 A002462

Adjacent sequences:  A115363 A115364 A115365 * A115367 A115368 A115369

KEYWORD

nonn,more

AUTHOR

Cino Hilliard, Mar 07 2006

EXTENSIONS

Edited by Don Reble, Apr 24 2006

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 05:14 EST 2019. Contains 320245 sequences. (Running on oeis4.)