login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048570 Triangle T(n,k) = number of divisors of binomial(n,k). 4
1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 3, 4, 3, 1, 1, 2, 4, 4, 2, 1, 1, 4, 4, 6, 4, 4, 1, 1, 2, 4, 4, 4, 4, 2, 1, 1, 4, 6, 8, 8, 8, 6, 4, 1, 1, 3, 9, 12, 12, 12, 12, 9, 3, 1, 1, 4, 6, 16, 16, 18, 16, 16, 6, 4, 1, 1, 2, 4, 8, 16, 16, 16, 16, 8, 4, 2, 1, 1, 6, 8, 12, 12, 24, 24, 24 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

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

FORMULA

T(n, k) = A000005(A007318(n, k)). - Michel Marcus, Mar 07 2020

EXAMPLE

Triangle begins

  1;

  1, 1;

  1, 2, 1;

  1, 2, 2, 1;

  1, 3, 4, 3, 1;

  1, 2, 4, 4, 2, 1;

  1, 4, 4, 6, 4, 4, 1;

  ...

PROG

(PARI) T(n, k) = if (n>=k, numdiv(binomial(n, k))); \\ Michel Marcus, Mar 07 2020

CROSSREFS

Cf. A000005, A007318.

Sequence in context: A156044 A180980 A275298 * A090806 A241926 A174446

Adjacent sequences:  A048567 A048568 A048569 * A048571 A048572 A048573

KEYWORD

nonn,tabl,easy

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 21:37 EDT 2020. Contains 334690 sequences. (Running on oeis4.)