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.

This page as a plain text file.
%I A099908 #8 Dec 12 2021 11:00:51
%S A099908 0,3,10,35,126,462,1716,2339,4627,2378,1332,4238,2198,5148,1260,57635,
%T A099908 14740,85026,61732,64410,100509,163716,158172,171918,93876,309780,
%U A099908 148969,444220,268280,370712,29792,532771,652200,938386,816466,907874
%N A099908 C(2n-1,n-1) mod n^4.
%C A099908 a(16843)=a(2124679)=1 meaning that 16843 and 2124679 are Wolstenholme primes A088164.
%H A099908 Chai Wah Wu, <a href="/A099908/b099908.txt">Table of n, a(n) for n = 1..10000</a>
%e A099908 a(11) =352716 mod 1461 =1332.
%t A099908 Table[Mod[Binomial[2n-1,n-1],n^4],{n,40}] (* _Harvey P. Dale_, Dec 12 2021 *)
%o A099908 (Python)
%o A099908 from __future__ import division
%o A099908 A099908_list, b = [], 1
%o A099908 for n in range(1,10001):
%o A099908     A099908_list.append(b % n**4)
%o A099908     b = b*2*(2*n+1)//(n+1) # _Chai Wah Wu_, Jan 26 2016
%Y A099908 Cf. A088164, A088218, A099905, A099906, A099907.
%K A099908 nonn
%O A099908 1,2
%A A099908 _Henry Bottomley_, Oct 29 2004