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!)
A309182 (1/3) times the number of n-member subsets of [3n] whose elements sum to a multiple of n. 2

%I

%S 1,2,10,42,201,1028,5538,30666,173593,1001402,5864750,34769364,

%T 208267320,1258574116,7663720710,46976034378,289628805623,

%U 1794932294978,11175157356522,69864075597442,438403736549145,2760351027094300,17433869214973754,110420300879752980

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

%C Also (1/2) times the number of n-member subsets of [3n-1] whose elements sum to a multiple of n.

%H Alois P. Heinz, <a href="/A309182/b309182.txt">Table of n, a(n) for n = 1..1000</a>

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

%p with(numtheory):

%p a:= n-> add(binomial(3*d, d)*(-1)^(n+d)*

%p phi(n/d), d in divisors(n))/(3*n):

%p seq(a(n), n=1..25);

%Y Column k=3 of A309148.

%K nonn

%O 1,2

%A _Alois P. Heinz_, Jul 15 2019

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 October 20 00:53 EDT 2021. Contains 348099 sequences. (Running on oeis4.)