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 A133635 #9 Feb 22 2023 19:19:28
%S A133635 26,34,49,58,74,77,82,91,98,106,119,121,122,133,143,146,154,161,169,
%T A133635 178,187,194,202,203,209,217,218,221,226,242,247,253,259,266,274,287,
%U A133635 289,298,299,301,314,319,322,323,329,338,341,343,346,361,362,371,377,386
%N A133635 Nonprime numbers k such that binomial(k+p,k) mod k = 1, where p=5.
%H A133635 Harvey P. Dale, <a href="/A133635/b133635.txt">Table of n, a(n) for n = 1..1000</a>
%t A133635 nn=400;With[{c=Complement[Range[nn],Prime[Range[PrimePi[nn]]]]}, Select[ c,Mod[Binomial[#+5,#],#]==1&]] (* _Harvey P. Dale_, Sep 24 2012 *)
%o A133635 (Python)
%o A133635 from itertools import count, islice
%o A133635 from math import comb
%o A133635 from sympy import isprime
%o A133635 def A133635_gen(startvalue=1): # generator of terms >= startvalue
%o A133635 return filter(lambda k:comb(k+5,k)%k==1 and not isprime(k),count(max(startvalue,1)))
%o A133635 A133635_list = list(islice(A133635_gen(),30)) # _Chai Wah Wu_, Feb 22 2023
%Y A133635 Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.
%Y A133635 Cf. A133875, A133885, A133880, A133890, A133900, A133910.
%K A133635 nonn
%O A133635 1,1
%A A133635 _Hieronymus Fischer_, Sep 30 2007