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.

A364447 Repeat [1,2,1,3].

This page as a plain text file.
%I A364447 #31 Jan 23 2025 12:38:08
%S A364447 1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,
%T A364447 1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,
%U A364447 1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1,2,1,3,1
%N A364447 Repeat [1,2,1,3].
%C A364447 Continued fraction of sqrt(5) - 3/2 = 0.7360679... (without integer part); and (4*sqrt(5) + 6)/11 = 1.3585701... (with integer part).
%C A364447 Lexicographically earliest sequence in which n is banned for n terms after each appearance (see A364448 for n^2 and A364449 for n^3).
%H A364447 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,1).
%F A364447 a(n) = A131743(n-1) + 1.
%t A364447 PadRight[{}, 100, {1, 2, 1, 3}] (* _Paolo Xausa_, Jan 23 2025 *)
%o A364447 (Python)
%o A364447 def A364447(n): return (3,1,2,1)[n&3] # _Chai Wah Wu_, Jul 29 2023
%Y A364447 Cf. A131743 (repeat [0,1,0,2]).
%Y A364447 Cf. A000034, A010882, A131534.
%Y A364447 Cf. A364448, A364449.
%K A364447 nonn,easy
%O A364447 1,2
%A A364447 _Rok Cestnik_, Jul 25 2023