cp's OEIS Frontend

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.

A361462 a(n) = A135506(n) mod 4.

This page as a plain text file.
%I A361462 #8 Mar 14 2023 18:31:51
%S A361462 2,1,2,1,1,3,1,1,1,3,1,1,1,1,1,1,1,3,1,1,3,3,1,1,1,1,1,1,1,3,1,3,1,1,
%T A361462 1,1,1,1,1,1,1,3,1,1,3,3,1,1,1,1,1,1,1,1,1,1,1,3,1,1,1,1,1,1,1,3,1,3,
%U A361462 1,3,1,1,1,1,1,1,1,3,1,1,1,3,1,1,3,1,1,1,1,1,3,1,3,1,1,1,1,1,1,1,1,3,1,1,1,3,1,1,1,1,1,1,1,3,1,1,3,1,1,1
%N A361462 a(n) = A135506(n) mod 4.
%H A361462 Antti Karttunen, <a href="/A361462/b361462.txt">Table of n, a(n) for n = 1..65537</a>
%F A361462 a(n) = A010873(A135506(n)).
%o A361462 (PARI)
%o A361462 up_to = 65537;
%o A361462 A135506list(up_to_n) = { my(v=vector(up_to), x1=1, x2); for(n=2, 1+up_to_n, x2 = x1+lcm(x1, n); v[n-1] = (x2/x1)-1; x1=x2); (v); };
%o A361462 v135506 = A135506list(up_to);
%o A361462 A135506(n) = v135506[n];
%o A361462 A361462(n) = (A135506(n)%4);
%Y A361462 Cf. A010873, A135506, A361463, A361464 (positions of 3's).
%K A361462 nonn
%O A361462 1,1
%A A361462 _Antti Karttunen_, Mar 13 2023