login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309185 (1/6) times the number of n-member subsets of [6n] whose elements sum to a multiple of n. 2
1, 5, 46, 445, 4751, 54086, 642342, 7861661, 98480332, 1256564755, 16273981758, 213378975958, 2826867619109, 37782552518478, 508840821830546, 6898459216311581, 94070535317459018, 1289430373107971804, 17755914760643605782, 245518560760433579195 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Also (1/5) times the number of n-member subsets of [6n-1] whose elements sum to a multiple of n.
LINKS
FORMULA
a(n) = 1/(6n) * Sum_{d|n} binomial(6d,d)*(-1)^(n+d)*phi(n/d).
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);
CROSSREFS
Column k=6 of A309148.
Sequence in context: A096947 A042533 A355056 * A169963 A198256 A232972
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jul 15 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)