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.

A362687 Binomial(n+p, n) mod n where p=7.

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