|
%I #10 Sep 15 2016 12:22:21
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,
%T 0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,
%U 0,0,0,0,8,0,0,0,0,0,4,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,4,0,0,0,0,0,4,0,0,0,1,0,0,0,0,0,0,0
%N a(n) = n modulo ludic factor of n: n mod A272565(n).
%H Antti Karttunen, <a href="/A276570/b276570.txt">Table of n, a(n) for n = 1..8008</a>
%H <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%F a(n) = n mod A272565(n).
%o (Scheme) (define (A276570 n) (modulo n (A272565 n)))
%Y Cf. A003309, A272565, A276580 (computed for each term of array A255127).
%Y Cf. A276568 (positions of zeros), A276569 (of nonzeros).
%K nonn
%O 1,19
%A _Antti Karttunen_, Sep 13 2016
|
