%I A003016 M0227
%S A003016 0,3,1,2,2,2,3,2,2,2,4,2,2,2,2,4,2,2,2,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,2,
%T A003016 4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,4,2,2,2,
%U A003016 3,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2
%N A003016 Number of occurrences of n as an entry in rows <= n of Pascal's triangle 
               (A007318).
%C A003016 Or, number of occurrences of n as a binomial coefficient.
%C A003016 A138495 and A138496 give record values and where they occur. - Reinhard 
               Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 20 2008
%D A003016 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A003016 H. L. Abbott, P. Erdos and D. Hanson, On the numbers of times an integer 
               occurs as a binomial coefficient, Amer. Math. Monthly, (1974), 256-261.
%D A003016 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 93, #47.
%D A003016 C. S. Ogilvy, Tomorrow's Math. 2nd ed., Oxford Univ. Press, 1972, p. 
               96.
%D A003016 D. Singmaster, How often does an integer occur as a binomial coefficient?, 
               Amer. Math. Monthly, 78 (1971), 385-386.
%H A003016 R. Zumkeller, <a href="b003016.txt">Table of n, a(n) for n = 0..10000</
               a>
%H A003016 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PascalsTriangle.html">Pascal's Triangle</a>
%H A003016 <a href="Sindx_Pas.html#Pascal">Index entries for triangles and arrays 
               related to Pascal's triangle</a>
%Y A003016 Cf. A003015, A059233.
%Y A003016 Sequence in context: A029418 A144148 A085247 this_sequence A108121 A161916 
               A072548
%Y A003016 Adjacent sequences: A003013 A003014 A003015 this_sequence A003017 A003018 
               A003019
%K A003016 nonn,nice,easy
%O A003016 0,2
%A A003016 N. J. A. Sloane (njas(AT)research.att.com).
%E A003016 More terms from Erich Friedman (erich.friedman(AT)stetson.edu)
%E A003016 Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 18 2007, at 
               the suggestion of Max Alekseyev.