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.
%I A133621 #11 Sep 24 2024 06:20:16 %S A133621 3,4,11,13,17,19,23,29,31,33,37,41,43,47,53,57,59,61,67,68,71,73,79, %T A133621 83,85,87,89,97,101,103,107,109,111,113,121,127,131,137,139,141,143, %U A133621 149,151,157,163,164,167,169,173,179,181,185,187,191,193,197,199,209,211 %N A133621 Numbers k such that binomial(k+p,k) mod k = 1, where p=10. %C A133621 All primes q > p are included, in that binomial(q+p,q) == (1+floor(p/q)) == 1 (mod q) holds for those primes. %o A133621 (PARI) isok(n) = ((binomial(n+10, n) % n) == 1) \\ _Michel Marcus_, Jul 15 2013 %Y A133621 Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636. %Y A133621 Cf. A133880, A133890, A133900, A133910. %K A133621 nonn %O A133621 1,1 %A A133621 _Hieronymus Fischer_, Sep 30 2007