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.

Showing 1-2 of 2 results.

A374395 a(n) is the first term in the n-th row of A374394.

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 2, 0, 1, 3, 3, 4, 0, 2, 2, 5, 6, 5, 7, 7, 0, 1, 3, 3, 4, 8, 10, 10, 8, 9, 11, 11, 12, 0, 2, 2, 5, 6, 5, 7, 7, 13, 14, 16, 16, 17, 13, 15, 15, 18, 19, 18, 20, 20, 0, 1, 3, 3, 4, 8, 10, 10, 8, 9, 11, 11, 12, 21, 23, 23, 26, 27, 26, 28, 28, 21
Offset: 0

Views

Author

Rémy Sigrist, Jul 10 2024

Keywords

Comments

a(n) is the least number z >= 0 such that the Zeckendorf representations of z and n-z have no common Fibonacci numbers and when combined together correspond to the lazy Fibonacci representation of n.

Crossrefs

Programs

  • PARI
    \\ See Links section.

Formula

a(n) = A022290(A374355(1+A003754(n)), k).
a(n) = n - A374396(n).

A374396 a(n) is the last term in the n-th row of A374394.

Original entry on oeis.org

0, 1, 2, 2, 4, 3, 4, 7, 7, 6, 7, 7, 12, 11, 12, 10, 10, 12, 11, 12, 20, 20, 19, 20, 20, 17, 16, 17, 20, 20, 19, 20, 20, 33, 32, 33, 31, 31, 33, 32, 33, 28, 28, 27, 28, 28, 33, 32, 33, 31, 31, 33, 32, 33, 54, 54, 53, 54, 54, 51, 50, 51, 54, 54, 53, 54, 54, 46
Offset: 0

Views

Author

Rémy Sigrist, Jul 10 2024

Keywords

Comments

a(n) is the greatest number z <= n such that the Zeckendorf representations of z and n-z have no common Fibonacci numbers and when combined together correspond to the lazy Fibonacci representation of n.

Crossrefs

Programs

  • PARI
    \\ See Links section.

Formula

a(n) = A022290(A374356(1+A003754(n)), k).
a(n) = n - A374395(n).
Showing 1-2 of 2 results.