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.

A357073 For n >= 1, a(n) = A003714(n) mod n.

Original entry on oeis.org

0, 0, 1, 1, 3, 3, 3, 0, 8, 8, 9, 9, 6, 5, 4, 4, 3, 4, 3, 2, 1, 21, 20, 20, 19, 20, 19, 18, 22, 21, 20, 20, 19, 26, 24, 22, 21, 19, 19, 17, 15, 18, 16, 14, 13, 11, 19, 17, 15, 14, 12, 12, 10, 8, 36, 33, 30, 28, 25, 24, 21, 18, 20, 17, 14, 12, 9, 16, 13, 10, 8, 5
Offset: 1

Views

Author

Ctibor O. Zizka, Sep 10 2022

Keywords

Comments

a(n) = 0 see A276488.

Examples

			a(5) = A003714(5) mod 5 = 8 mod 5 = 3.
		

Crossrefs

Programs

  • Mathematica
    fib = Select[Range[300], BitAnd[#, 2*#] == 0 &]; Mod[fib, Range[Length[fib]]] (* Amiram Eldar, Sep 10 2022 *)
  • Python
    def A357073(n):
        tlist, s, m = [1, 2], 0, n
        while (t:=tlist[-1]+tlist[-2]) <= n:
            tlist.append(t)
        for d in tlist[::-1]:
            s = (s<<1)%n
            if d <= m:
                s = (s+1)%n
                m -= d
        return s # Chai Wah Wu, Sep 11 2022

Formula

a(n) = A003714(n) mod n.