|
%I #24 Mar 06 2024 14:48:26
%S 1,0,1,4,4,2,2,0,15,3,1,26,26,24,24,18,18,16,16,12,12,6,81,81,73,73,
%T 71,63,57,57,29,29,23,23,13,13,1,158,154,154,148,148,138,138,134,134,
%U 122,122,118,118,114,114,112,112,106,106,100,100,94,94,92
%N a(n) = A364054(n-1) mod prime(n-1).
%H Chai Wah Wu, <a href="/A366470/b366470.txt">Table of n, a(n) for n = 2..10000</a>
%H Michael De Vlieger, <a href="/A366470/a366470_1.png">Log log scatterplot of a(n)</a>, n = 1..2^20.
%H Michael De Vlieger, <a href="/A366470/a366470_2.png">Log log scatterplot of a(n)</a>, n = 2..2^20, showing a(n) = 0 instead as a(n) = 1/10, with a color function showing b(n) = 0 in black, b(n) = 1 in blue, b(n) = 2 in green, b(n) = 3 in chartreuse, and b(n) = 4 in red, where b() = A366475(). (The plot accentuates larger values of b(n) through larger size, so adjacent smaller values may be eclipsed.)
%H Chai Wah Wu, <a href="/A366470/a366470.png">Graph of first 10^8 terms</a>
%F A364054(n) = A366475(n)*prime(n-1) + a(n) for n > 1. - _Michael De Vlieger_, Mar 06 2024
%t nn = 2^20; c[_] := False; m[_] := 0; j = 1; c[0] = c[1] = True;
%t Monitor[Do[p = Prime[n - 1]; r = Mod[j, p];
%t While[Set[k, p m[p] + r ]; c[k], m[p]++];
%t Set[{a[n - 1], c[k], j}, {r, True, k}], {n, 2, nn + 1}], n];
%t Array[a, nn] (* _Michael De Vlieger_, Oct 27 2023 *)
%o (Python)
%o from itertools import count, islice
%o from sympy import nextprime
%o def A366470_gen(): # generator of terms
%o a, aset, p = 1, {0,1}, 2
%o while True:
%o yield a
%o for b in count(a,p):
%o if b not in aset:
%o aset.add(b)
%o a = b%(p:=nextprime(p))
%o break
%o A366470_list = list(islice(A366470_gen(),30)) # _Chai Wah Wu_, Oct 22 2023
%Y Cf. A364054, A366475.
%K nonn
%O 2,4
%A _N. J. A. Sloane_, Oct 21 2023
|
