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 A239702 #15 Jan 25 2016 14:22:42 %S A239702 1,1,1,1,1,1,1,2,2,1,1,1,2,1,1,1,4,4,4,4,1,1,2,8,4,8,2,1,1,6,12,24,24, %T A239702 12,6,1,1,1,6,6,24,6,6,1,1,1,2,2,6,12,12,6,2,2,1,1,4,8,4,24,12,24,4,8, %U A239702 4,1,1,10,40,40,40,60,60,40,40,40,10,1,1,2 %N A239702 Triangle read by rows: T(n,k) = A239682(n)/(A239682(k)* A239682(n-k)). %C A239702 A239682(0) = 1 since it is the empty product. %C A239702 These are the generalized binomial coefficients associated with the sequence A173557. %H A239702 Tom Edgar, <a href="http://www.emis.de/journals/INTEGERS/papers/o62/o62.Abstract.html">Totienomial Coefficients</a>, INTEGERS, 14 (2014), #A62. %H A239702 Tom Edgar and Michael Z. Spivey, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL19/Edgar/edgar3.html">Multiplicative functions, generalized binomial coefficients, and generalized Catalan numbers</a>, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.6. %H A239702 Donald E. Knuth and Herbert S. Wilf, <a href="http://www.math.upenn.edu/~wilf/website/dm36.pdf">The power of a prime that divides a generalized binomial coefficient</a>, J. Reine Angew. Math., 396:212-219, 1989. %F A239702 T(n,k) = A239682(n)/(A239682(k)* A239682(n-k)). %F A239702 T(n,k) = prod_{i=1..n} A173557(i)/(prod_{i=1..k} A173557(i)*prod_{i=1..n-k} A173557(i)). %F A239702 T(n,k) = A173557(n)/n*(k/A173557(k)*T(n-1,k-1)+(n-k)/A173557(n-k)*T(n-1,k)). %e A239702 The first six terms A173557 are 1,1,2,1,4,2 and so T(4,2) = 1*2*1*1/((1*1)*(1*1))=2 and T(6,3) = 2*4*1*2*1*1/((2*1*1)*(2*1*1))=4. %e A239702 The triangle begins %e A239702 1 %e A239702 1 1 %e A239702 1 1 1 %e A239702 1 2 2 1 %e A239702 1 1 2 1 1 %e A239702 1 4 4 4 4 1 %e A239702 1 2 8 4 8 2 1 %e A239702 1 6 12 24 24 12 6 1 %o A239702 (Sage) %o A239702 q=100 #change q for more rows %o A239702 P=[0]+[prod([(x-1) for x in prime_divisors(n)]) for n in [1..q]] %o A239702 [[prod(P[1:n+1])/(prod(P[1:k+1])*prod(P[1:(n-k)+1])) for k in [0..n]] for n in [0..len(P)-1]] # generates the triangle up to q rows. %Y A239702 Cf. A239682, A173557, A048804, A238453. %K A239702 nonn,tabl %O A239702 0,8 %A A239702 _Tom Edgar_, Mar 24 2014