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 A318989 #9 Sep 07 2018 03:14:38 %S A318989 0,1,0,1,1,3,2,5,0,1,6,9,1,9,6,5,4,9,14,1,9,17,14,21,6,1,18,9,0,21,6, %T A318989 5,6,21,16,9,2,33,27,21,6,9,3,17,36,37,19,21,16,31,21,1,6,45,6,37,33, %U A318989 29,34,21,52,37,9,5,1,39,40,21,60,51,42,45,42,39,6,33,72,27,28,21,72,47,56,9,21,3,0,61,37,81,79,37,6,19,71,69,11,65,72,81 %N A318989 Limiting value of A318970(k) mod n as k grows. %C A318989 Is there a prime p in A318971 such that a(p) is nonzero? %F A318989 a(n) = A318970(k) mod n holds for any k >= A227944(n). In particular, a(n) = A318970(A227944(n)) mod n. %Y A318989 Cf. A245970, A254410, A254411, A318970, A318971. %K A318989 nonn %O A318989 1,6 %A A318989 _Max Alekseyev_, Sep 06 2018