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.

A309185 (1/6) times the number of n-member subsets of [6n] whose elements sum to a multiple of n.

Original entry on oeis.org

1, 5, 46, 445, 4751, 54086, 642342, 7861661, 98480332, 1256564755, 16273981758, 213378975958, 2826867619109, 37782552518478, 508840821830546, 6898459216311581, 94070535317459018, 1289430373107971804, 17755914760643605782, 245518560760433579195
Offset: 1

Views

Author

Alois P. Heinz, Jul 15 2019

Keywords

Comments

Also (1/5) times the number of n-member subsets of [6n-1] whose elements sum to a multiple of n.

Crossrefs

Column k=6 of A309148.

Programs

  • Maple
    with(numtheory):
    a:= n-> add(binomial(6*d, d)*(-1)^(n+d)*
            phi(n/d), d in divisors(n))/(6*n):
    seq(a(n), n=1..25);

Formula

a(n) = 1/(6n) * Sum_{d|n} binomial(6d,d)*(-1)^(n+d)*phi(n/d).