References to A159553

a(0)=0. For n >= 1, a(n) = sum{k=0 to n} binomial(n,k) * GCD(n,k).
0, 2, 6, 12, 28, 40, 144, 140, 536, 864, 2560, 2068, 12720, 8216, 45192, 78660


2 seqfan posts

Tue Apr 14 23:04:24 CEST 2009    [seqfan] Re: When n^2 divides sum
Tue Apr 14 22:42:27 CEST 2009    [seqfan] When n^2 divides sum

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .