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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A242473 Binomial(2p-1,p-1) modulo p^4, with p=prime(n). 3

%I #62 Jun 26 2017 13:10:50

%S 3,10,126,1716,1332,2198,14740,61732,158172,268280,29792,557184,

%T 2343315,2623732,3218514,5657327,11911983,12710937,7218313,12526886,

%U 24119055,18735483,13151102,19034164,87616609

%N Binomial(2p-1,p-1) modulo p^4, with p=prime(n).

%C A value of 1 indicates a Wolstenholme prime.

%H Chai Wah Wu, <a href="/A242473/b242473.txt">Table of n, a(n) for n = 1..10000</a>

%t Table[Mod[Binomial[2p-1,p-1],p^4],{p,Prime[Range[30]]}] (* _Harvey P. Dale_, Jun 26 2017 *)

%o (PARI) forprime(n=2, 10^2, m=(binomial(2*n-1, n-1)%n^4); print1(m, ", "));

%o (Python)

%o from __future__ import division

%o from sympy import isprime

%o A242473_list, b = [], 1

%o for n in range(1,10**4):

%o if isprime(n):

%o A242473_list.append(b % n**4)

%o b = b*2*(2*n+1)//(n+1) # _Chai Wah Wu_, Jan 26 2016

%Y Cf. A088164, A099905, A099906, A099907. Subsequence of A099908.

%K nonn

%O 1,1

%A _Felix Fröhlich_, May 26 2014

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 April 24 19:31 EDT 2024. Contains 371962 sequences. (Running on oeis4.)