cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A099908 C(2n-1,n-1) mod n^4.

Original entry on oeis.org

0, 3, 10, 35, 126, 462, 1716, 2339, 4627, 2378, 1332, 4238, 2198, 5148, 1260, 57635, 14740, 85026, 61732, 64410, 100509, 163716, 158172, 171918, 93876, 309780, 148969, 444220, 268280, 370712, 29792, 532771, 652200, 938386, 816466, 907874
Offset: 1

Views

Author

Henry Bottomley, Oct 29 2004

Keywords

Comments

a(16843)=a(2124679)=1 meaning that 16843 and 2124679 are Wolstenholme primes A088164.

Examples

			a(11) =352716 mod 1461 =1332.
		

Crossrefs

Programs

  • Mathematica
    Table[Mod[Binomial[2n-1,n-1],n^4],{n,40}] (* Harvey P. Dale, Dec 12 2021 *)
  • Python
    from _future_ import division
    A099908_list, b = [], 1
    for n in range(1,10001):
        A099908_list.append(b % n**4)
        b = b*2*(2*n+1)//(n+1) # Chai Wah Wu, Jan 26 2016