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].

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Rok Cestnik, Jul 25 2023

Keywords

Comments

Continued fraction of sqrt(5) - 3/2 = 0.7360679... (without integer part); and (4*sqrt(5) + 6)/11 = 1.3585701... (with integer part).
Lexicographically earliest sequence in which n is banned for n terms after each appearance (see A364448 for n^2 and A364449 for n^3).

Crossrefs

Cf. A131743 (repeat [0,1,0,2]).

Programs

  • Mathematica
    PadRight[{}, 100, {1, 2, 1, 3}] (* Paolo Xausa, Jan 23 2025 *)
  • Python
    def A364447(n): return (3,1,2,1)[n&3] # Chai Wah Wu, Jul 29 2023

Formula

a(n) = A131743(n-1) + 1.