|
|
A356399
|
|
a(n) is the smallest term (in absolute value) in the negaFibonacci representation of n.
|
|
2
|
|
|
1, 2, 1, -1, 5, 1, 2, 1, -1, -3, 1, -1, 13, 1, 2, 1, -1, 5, 1, 2, 1, -1, -3, 1, -1, -8, 1, 2, 1, -1, -3, 1, -1, 34, 1, 2, 1, -1, 5, 1, 2, 1, -1, -3, 1, -1, 13, 1, 2, 1, -1, 5, 1, 2, 1, -1, -3, 1, -1, -8, 1, 2, 1, -1, -3, 1, -1, -21, 1, 2, 1, -1, 5, 1, 2, 1, -1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
For n > 1, the greatest term in the negaFibonacci representation of n is A280511(n-1).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n = 11:
- 11 = F(-1) + F(-4) + F(-7),
- so a(11) = F(-1) = 1.
|
|
PROG
|
(PARI) a(n) = { my (v=0, neg=0, pos=0, f); 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); ); ); }
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|