References to A159458

Numbers n such that n^2 divides A159068(n), where A159068(n) = sum{k=1 to n} binomial(n,k) * GCD(n,k).
1, 2, 3, 11, 33, 309, 665, 1461, 2323, 678

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 .