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

 

Logo

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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A232039 Primes p congruent to 1 mod 12 such that (p + 1)/2 does not divide the numerator of the Bernoulli number B(p + 1). 1
109, 769, 1429, 2089, 2161, 2749, 3541, 4729, 4969, 6577, 6709, 7369, 8689, 9349, 9613, 10009, 11329, 13309, 14629, 15289, 17029, 17929, 19249, 21757, 22549, 23209, 23869, 24793, 25189, 25849, 30469, 33769, 34429, 35089, 39709, 41077, 42349, 43669, 46309 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A prime p is in the sequence if p is of the form 660*n + 109.
LINKS
EXAMPLE
109 is in the sequence because B(110) = (5 * 157 * 76493 * C)/1518 (where C is some large, unfactored composite number), the numerator of which is not divisible by 110/2 = 5 * 11.
97 is not in the sequence because B(98) = (7^2 * 2857 * 3221 * C)/6, the numerator of which is divisible by 98/2 = 49 = 7^2.
MATHEMATICA
Select[12Range[864] + 1, PrimeQ[#] && Not[Divisible[Numerator[Bernoulli[# + 1]], (# + 1)/2]] &] (* Alonso del Arte, Nov 17 2013 *)
PROG
(PARI) forstep(p=1, 46309, 12, if(isprime(p)&&!Mod(numerator(bernfrac(p+1)), (p+1)/2)==0, print1(p, ", ")));
CROSSREFS
Sequence in context: A226473 A142366 A103734 * A301743 A178263 A061699
KEYWORD
nonn
AUTHOR
STATUS
approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 18:06 EST 2023. Contains 367563 sequences. (Running on oeis4.)