cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A159458 Numbers m such that m^2 divides A159068(m), where A159068(m) = Sum_{k=1..m} binomial(m,k) * gcd(m,k).

This page as a plain text file.
%I A159458 #15 Aug 10 2021 11:05:25
%S A159458 1,2,3,11,33,309,665,1461,2323,6789
%N A159458 Numbers m such that m^2 divides A159068(m), where A159068(m) = Sum_{k=1..m} binomial(m,k) * gcd(m,k).
%C A159458 m divides A159068(m) for all positive integers m.
%o A159458 (PARI) is(m) = sum(k=1, m, binomial(m, k)*gcd(k, m))%m^2 == 0; \\ _Jinyuan Wang_, Aug 10 2021
%Y A159458 Cf. A159068, A159069.
%K A159458 nonn,more
%O A159458 1,2
%A A159458 _Leroy Quet_, Apr 12 2009
%E A159458 4 more terms from _R. J. Mathar_, Apr 16 2009
%E A159458 a(10)=6789 from _Ray Chandler_, Jun 19 2009