login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A215658
Primes p such that the smallest positive integer k for which p# + k is square satisfies p# + k = k^2, where p# = 2*3*5*7*11*...*p is a primorial.
5
2, 3, 5, 7, 17
OFFSET
1,1
COMMENTS
The corresponding values of k are 2, 3, 6, 15, 715 = A215659.
The equation p# + k = k^2 has an integer solution k if and only if 1 + 4*p# is a square.
Conjecture: Not the same sequence as A192579, which is finite.
When p is in this sequence, p# = k(k-1) is in A161620, the intersection of A002110 and A002378. - Jeppe Stig Nielsen, Mar 27 2018
LINKS
C. Aebi and G. Cairns, Partitions of primes, Parabola 45, Issue 1 (2009); see p. 5.
FORMULA
A145781(n) = A216144(n) if and only if prime(n) is a member.
a(n)# = A215659(n)*(A215659(n)-1).
EXAMPLE
The smallest square > 17# = 510510 is 715^2 = 17# + 715, so 17 is a member.
MATHEMATICA
t = {}; pm = 1; Do[pm = pm*p; s = Floor[Sqrt[pm]]; If[pm == s*(s+1), AppendTo[t, p]], {p, Prime[Range[100]]}]; t (* T. D. Noe, Sep 05 2012 *)
PROG
(PARI) for (n=1, 10, if (ceil(sqrt(prod(i=1, n, prime(i))))^2 - prod(i=1, n, prime(i)) - ceil(sqrt(prod(i=1, n, prime(i)))) == 0, print(prime(n))); ); \\ Michel Marcus, Sep 05 2012
(Python)
from sympy import primorial, integer_nthroot, prime
A215658_list = [prime(i) for i in range(1, 10**2) if integer_nthroot(4*primorial(i)+1, 2)[1]] # Chai Wah Wu, Apr 01 2021
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jonathan Sondow, Sep 02 2012
STATUS
approved