The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206590 Number of solutions (n,k) of k^3=n^3 (mod n), where 1<=k

%I

%S 0,0,1,0,0,0,3,2,0,0,1,0,0,0,3,0,2,0,1,0,0,0,3,4,0,8,1,0,0,0,7,0,0,0,

%T 5,0,0,0,3,0,0,0,1,2,0,0,3,6,4,0,1,0,8,0,3,0,0,0,1,0,0,2,15,0,0,0,1,0,

%U 0,0,11,0,0,4,1,0,0,0,3,8,0,0,1,0,0,0,3,0,2,0,1,0,0,0,7,0,6,2

%N Number of solutions (n,k) of k^3=n^3 (mod n), where 1<=k<n.

%H Antti Karttunen, <a href="/A206590/b206590.txt">Table of n, a(n) for n = 2..16384</a>

%e 8 divides exactly 3 of the numbers 8^3-k^3 for k = 1, 2 , ..., 7, so that a(8) = 3.

%t f[n_, k_] := If[Mod[n^3 - k^3, n] == 0, 1, 0];

%t t[n_] := Flatten[Table[f[n, k], {k, 1, n - 1}]]

%t a[n_] := Count[Flatten[t[n]], 1]

%t Table[a[n], {n, 2, 120}] (* A206590 *)

%o (PARI) A206590(n) = { my(n3 = n^3); sum(k=1,n-1,!((n3-(k^3))%n)); }; \\ _Antti Karttunen_, Nov 17 2017

%Y Cf. A206825.

%K nonn

%O 2,7

%A _Clark Kimberling_, Feb 09 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 13:05 EST 2021. Contains 349563 sequences. (Running on oeis4.)