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