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.

A362686 Binomial(n+p, n) mod n where p=6.

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