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 A216602 #6 Jul 13 2013 12:04:31 %S A216602 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,2,0,0,1,0,0,1,0,3,0,0, %T A216602 0,4,0,0,0,2,0,2,0,0,1,0,0,7,1,1,0,0,0,4,0,3,0,0,0,5,0,0,2,7,0,2,0,0, %U A216602 0,2,0,11,0,0,1,0,1,2,0,7,3,0,0,6,0,0 %N A216602 Number of ways to write n as a product with all factors <= n/6. %C A216602 a(n) = A066032(n,floor(n/6)) for n > 5. %H A216602 Reinhard Zumkeller, <a href="/A216602/b216602.txt">Table of n, a(n) for n = 1..1000</a> %e A216602 a(60) = #{10*6, 10*3*2, 6*5*2, 5*4*3, 5*3*2*2, } = 5; %e A216602 a(61) = #{} = 0; %e A216602 a(62) = #{} = 0; %e A216602 a(63) = #{9*7, 7*3*3} = 2; %e A216602 a(64) = #{8*8, 8*4*2, 8*2*2*2, 4*4*4, 4*4*2*2, 4*2*2*2*2, 2*2*2*2*2*2} = 7; %e A216602 a(65) = #{} = 0. %o A216602 (Haskell) %o A216602 a216602 n | n <= 5 = 0 %o A216602 | otherwise = a066032_tabl !! (n-1) !! (n `div` 6 - 1) %Y A216602 Cf. A001055, A028422, A216599, A216600, A216601. %K A216602 nonn %O A216602 1,24 %A A216602 _Reinhard Zumkeller_, Oct 01 2012