|
Search: id:A003016
|
|
|
| A003016 |
|
Number of occurrences of n as an entry in rows <= n of Pascal's triangle (A007318).
(Formerly M0227)
|
|
+0
8
|
|
| 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, 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, 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
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Or, number of occurrences of n as a binomial coefficient.
A138495 and A138496 give record values and where they occur. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 20 2008
|
|
REFERENCES
|
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.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 93, #47.
C. S. Ogilvy, Tomorrow's Math. 2nd ed., Oxford Univ. Press, 1972, p. 96.
D. Singmaster, How often does an integer occur as a binomial coefficient?, Amer. Math. Monthly, 78 (1971), 385-386.
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Pascal's Triangle
Index entries for triangles and arrays related to Pascal's triangle
|
|
CROSSREFS
|
Cf. A003015, A059233.
Sequence in context: A033178 A029418 A085247 this_sequence A108121 A072548 A079399
Adjacent sequences: A003013 A003014 A003015 this_sequence A003017 A003018 A003019
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Erich Friedman (erich.friedman(AT)stetson.edu)
Edited by njas, Nov 18 2007, at the suggestion of Max Alekseyev.
|
|
|
Search completed in 0.002 seconds
|
