login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048571 Triangle read by rows: T(n,k) = number of distinct prime factors of C(n,k). 4
0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 2, 2, 2, 2, 2, 0, 0, 1, 2, 2, 2, 2, 1, 0, 0, 1, 2, 2, 3, 2, 2, 1, 0, 0, 1, 2, 3, 3, 3, 3, 2, 1, 0, 0, 2, 2, 3, 4, 3, 4, 3, 2, 2, 0, 0, 1, 2, 3, 4, 4, 4, 4, 3, 2, 1, 0, 0, 2, 3, 3, 3, 3, 4, 3, 3, 3, 3, 2, 0 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,13

REFERENCES

Pierre Goetgheluck, On prime divisors of binomial coefficients, Math. Comp. 51 (1988), no. 183, 325-329.

LINKS

T. D. Noe, Rows n=0..100 of triangle, flattened

EXAMPLE

Triangle begins:

0

0,0

0,1,0

0,1,1,0

0,1,2,1,0

0,1,2,2,1,0

0,2,2,2,2,2,0

0,1,2,2,2,2,1,0

...

MATHEMATICA

Flatten[Table[b=Binomial[n, k]; Length[FactorInteger[b]], {n, 0, 12}, {k, 0, n}]] - T. D. Noe (noe(AT)sspectra.com), Oct 19 2007

CROSSREFS

Cf. A132896.

Sequence in context: A137867 A111143 A004197 * A025880 A058755 A128519

Adjacent sequences:  A048568 A048569 A048570 * A048572 A048573 A048574

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com); edited Oct 06 2007 at the suggestion of T. D. Noe.

EXTENSIONS

Corrected by T. D. Noe (noe(AT)sspectra.com), Oct 19 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 12:36 EST 2012. Contains 206020 sequences.