%I A059233
%S A059233 1,1,1,1,2,1,1,1,2,1,1,1,1,2,1,1,1,1,2,2,1,1,1,1,1,1,2,1,1,1,1,1,1,2,2,
%T A059233 1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,1,1,1,1,1,2,1,1,1,2,1,
%U A059233 1,1,1,1,1,1,2,1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1
%N A059233 Number of rows in which n appears in Pascal's triangle (A007318).
%D A059233 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 93, #47.
%D A059233 C. S. Ogilvy, Tomorrow's Math. 2nd ed., Oxford Univ. Press, 1972, p. 
               96.
%D A059233 D. Singmaster, How often does an integer occur as a binomial coefficient?, 
               Amer. Math. Monthly, 78 (1971), 385-386.
%H A059233 T. D. Noe, <a href="b059233.txt">Table of n, a(n) for n=2..10000</a>
%H A059233 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PascalsTriangle.html">Pascal's Triangle</a>
%e A059233 6 appears in both row 4 and row 6 in Pascal's triangle, therefore a(6)=2.
%Y A059233 Cf. A003016, A003015.
%Y A059233 Sequence in context: A062557 A003649 A003650 this_sequence A143898 A101873 
               A146289
%Y A059233 Adjacent sequences: A059230 A059231 A059232 this_sequence A059234 A059235 
               A059236
%K A059233 easy,nice,nonn
%O A059233 2,5
%A A059233 Fabian Rothelius (fabian.rothelius(AT)telia.com), Jan 20 2001