OFFSET
1,2
COMMENTS
Related to hyperperfect numbers of a certain form.
The formula by J. Krizek is explained as follows: If p=(3n+1)/2 is prime, then it is an integer, and p must be of the form p=3m-1, i.e., p=A003627(k). On the other hand, if p=A003627(k), then all k < p are coprime to p, so we have B(p) = (Sum_{k<p} k^2)/(Sum_{k<p} k) = (2p-1)/3. This is an integer, since p=3m-1, and for this number n = (2p-1)/3 = 2m-1, we have that (3n+1)/2 = p is prime. - M. F. Hasler, Nov 29 2010
LINKS
J. S. McCranie, A study of hyperperfect numbers, J. Int. Seqs. Vol. 3 (2000) #P00.1.3.
FORMULA
EXAMPLE
MATHEMATICA
Select[Range[500], PrimeQ[(3# + 1)/2] &] (* Harvey P. Dale, Jan 15 2011 *)
PROG
(Magma) [ n: n in [1..400 by 2] | IsPrime((3*n+1) div 2) ];
(PARI) is(n)=isprime((3*n+1)/2) \\ Charles R Greathouse IV, Feb 20 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Corrected by Vincenzo Librandi, Mar 24 2010
STATUS
approved