cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A292998 Number of sequences of balls colored with at most n colors such that exactly three balls are the same color as some other ball in the sequence.

Original entry on oeis.org

1, 10, 87, 772, 7285, 74046, 812875, 9626632, 122643657, 1675253170, 24449818591, 379984902540, 6268557335677, 109443030279142, 2016658652491155, 39119860206021136, 797013832285599505, 17017679492994949722, 380045072079456330727
Offset: 1

Views

Author

Jeremy Dover, Sep 27 2017

Keywords

Comments

Note that any such sequence has at least 3 balls and at most n+2, and that three matching balls must all be the same color.

Examples

			For n=2 colors a, b, the a(n)=10 sequences of balls are: aaa, bbb, abbb, babb, bbab, bbba, baaa, abaa, aaba, aaab.
		

Crossrefs

Row sums of triangle A292930.

Programs

  • Mathematica
    Table[n!*Sum[Binomial[k, 3]/(n + 2 - k)!, {k, 3, n + 2}], {n, 19}] (* Michael De Vlieger, Sep 28 2017 *)
  • PARI
    a(n) = n! * sum(k=3, n+2, binomial(k,3)/(n+2-k)!); \\ Michel Marcus, Sep 29 2017

Formula

a(n) = n! * Sum_{k=3..n+2} binomial(k,3)/(n+2-k)!.
Showing 1-1 of 1 results.