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-1 of 1 results.

A356400 a(n) is the smallest term (in absolute value) in the negaFibonacci representation of -n.

Original entry on oeis.org

-1, 1, -3, -1, 1, 2, 1, -8, -1, 1, -3, -1, 1, 2, 1, 5, -1, 1, 2, 1, -21, -1, 1, -3, -1, 1, 2, 1, -8, -1, 1, -3, -1, 1, 2, 1, 5, -1, 1, 2, 1, 13, -1, 1, -3, -1, 1, 2, 1, 5, -1, 1, 2, 1, -55, -1, 1, -3, -1, 1, 2, 1, -8, -1, 1, -3, -1, 1, 2, 1, 5, -1, 1, 2, 1
Offset: 1

Views

Author

Rémy Sigrist, Aug 06 2022

Keywords

Comments

See A139764 and A356399 for similar sequences.

Examples

			For n = 11:
- using F(-k) = A039834(k):
- -11 = F(-4) + F(-6),
- so a(11) = F(-4) = -3.
		

Crossrefs

Programs

  • PARI
    a(n) = { my (v=0, neg=0, pos=0, f); n=-n; for (e=0, oo, f=fibonacci(-1-e); if (f<0, neg+=f, pos+=f); if (neg <=n && n <= pos, while (n, if (f<0, neg-=f, pos-=f); if (neg > n || n > pos, v=f; n-=f;); f=fibonacci(-1-e--);); return (v););); }

Formula

a(n) = -n iff n belongs to A001906.
Showing 1-1 of 1 results.