|
|
A159458
|
|
Numbers m such that m^2 divides A159068(m), where A159068(m) = Sum_{k=1..m} binomial(m,k) * gcd(m,k).
|
|
1
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
m divides A159068(m) for all positive integers m.
|
|
LINKS
|
|
|
PROG
|
(PARI) is(m) = sum(k=1, m, binomial(m, k)*gcd(k, m))%m^2 == 0; \\ Jinyuan Wang, Aug 10 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|