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.

A362688 Binomial(n+p, n) mod n where p=8.

This page as a plain text file.
%I A362688 #4 Apr 29 2023 20:54:20
%S A362688 0,1,0,3,2,3,2,6,1,8,1,6,1,10,9,15,1,1,1,5,18,1,1,12,6,14,1,12,1,12,1,
%T A362688 13,12,1,13,19,1,1,27,34,1,0,1,34,10,24,1,27,8,11,18,1,1,1,12,16,39,
%U A362688 30,1,48,1,32,10,25,14,45,1,35,24,25,1,46,1,38,66
%N A362688 Binomial(n+p, n) mod n where p=8.
%H A362688 Ray Chandler, <a href="/A362688/b362688.txt">Table of n, a(n) for n = 1..1000</a>
%H A362688 <a href="/index/Rec#order_645120">Index entries for linear recurrences with constant coefficients</a>, order 645120.
%F A362688 a(n)=binomial(n+8,n) mod n.
%F A362688 For n > 645240, a(n) = 2*a(n-322560) - a(n-645120).
%t A362688 Table[Mod[Binomial[n+8,n],n],{n,90}]
%Y A362688 Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.
%Y A362688 Cf. A133875, A133885, A133880, A133890, A133900, A133910, A362686, A362687, A362689.
%K A362688 nonn
%O A362688 1,4
%A A362688 _Ray Chandler_, Apr 29 2023