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 A242342 #12 May 23 2019 15:54:37
%S A242342 0,0,3,4,10,15,21,56,36,120,55,792,78,364,105,560,136,3060,171,1140,
%T A242342 210,1540,253,42504,300,2600,351,3276,406,27405,465,4960,528,5984,595,
%U A242342 376992,666,8436,741,9880,820,111930,903,13244,990,15180,1081,1712304,1176
%N A242342 a(n) = binomial(n, smallest non-divisor of n).
%H A242342 Reinhard Zumkeller, <a href="/A242342/b242342.txt">Table of n, a(n) for n = 1..10000</a>
%F A242342 a(n) = A007318(n, A007978(n)) for n > 2.
%F A242342 a(2*n-1) = A014105(n).
%t A242342 Join[{0,0},Table[Binomial[n,Complement[Range[DivisorSigma[0,n]], Divisors[ n]][[1]]],{n,3,50}]] (* _Harvey P. Dale_, May 23 2019 *)
%o A242342 (Haskell)
%o A242342 a242342 n = if n <= 2 then 0 else a007318' n (a007978 n)
%Y A242342 Cf. A014105.
%K A242342 nonn
%O A242342 1,3
%A A242342 _Reinhard Zumkeller_, May 11 2014