**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*

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 .