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!)
A309186 (1/7) times the number of n-member subsets of [7n] whose elements sum to a multiple of n. 2
1, 6, 64, 734, 9276, 124872, 1753074, 25366334, 375677659, 5667202856, 86775157140, 1345153548200, 21069043965984, 332927798516620, 5301031234085664, 84967018635587774, 1369846562874360887, 22199151535757780226, 361411377745122110422, 5908312923795257322184 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Also (1/6) times the number of n-member subsets of [7n-1] whose elements sum to a multiple of n.
LINKS
FORMULA
a(n) = 1/(7n) * Sum_{d|n} binomial(7d,d)*(-1)^(n+d)*phi(n/d).
MAPLE
with(numtheory):
a:= n-> add(binomial(7*d, d)*(-1)^(n+d)*
phi(n/d), d in divisors(n))/(7*n):
seq(a(n), n=1..25);
PROG
(PARI) a(n) = 1/(7*n) * sumdiv(n, d, binomial(7*d, d)*(-1)^(n+d)*eulerphi(n/d)); \\ Michel Marcus, Jul 18 2019
CROSSREFS
Column k=7 of A309148.
Sequence in context: A230282 A186668 A025609 * A156887 A239847 A264634
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 19 03:33 EDT 2024. Contains 370952 sequences. (Running on oeis4.)