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.
%I A376757 #23 Oct 07 2024 09:07:36 %S A376757 1,2,3,5,5,6,13,14,18,10,11,15,25,26,15,28,17,36,37,25,39,22,23,42,35, %T A376757 50,81,71,29,30,61,72,33,34,65,99,73,74,75,70,41,78,85,55,90,46,47,84, %U A376757 112,70,51,137,53,162,55,218,111,58,59,75,121,122,288,208,125,66,133,85,69,130,71,306,145,146,105,203,143,150,157 %N A376757 Number of pairs 0 <= x <= y <= n-1 such that x^3 == y^3 (mod n). %C A376757 A087786 includes pairs (x,y) with x>y (which are excluded from the present sequence). %H A376757 Seiichi Manyama, <a href="/A376757/b376757.txt">Table of n, a(n) for n = 1..10000</a> %o A376757 (PARI) a(n) = sum(x=0, n-1, sum(y=x, n-1, Mod(x, n)^3 == Mod(y, n)^3)); \\ _Michel Marcus_, Oct 06 2024 %o A376757 (Python) %o A376757 from collections import Counter %o A376757 def A376757(n): return sum(d*(d+1)>>1 for d in Counter(pow(x,3,n) for x in range(n)).values()) # _Chai Wah Wu_, Oct 06 2024 %Y A376757 Cf. A000086, A087786, A046530, A290731, A376202, A376203, A376755, A376756. %K A376757 nonn %O A376757 1,2 %A A376757 _Tom Duff_ and _N. J. A. Sloane_, Oct 06 2024