|
Search: id:A111466
|
|
|
| A111466 |
|
a(1) = 1, a(n+1) = a(n)- F(n+1), if Fn+1) <= a(n), else a(n+1) = a(n)+ F(n+1). F(n) is the n-th Fibonacci number (A000045). |
|
+0
1
|
|
| 1, 0, 2, 5, 0, 8, 21, 0, 34, 89, 0, 144, 377, 0, 610, 1597, 0, 2584, 6765, 0, 10946, 28657, 0, 46368, 121393, 0, 196418, 514229, 0, 832040, 2178309, 0, 3524578, 9227465, 0, 14930352, 39088169, 0, 63245986, 165580141, 0, 267914296, 701408733, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
a(3n+2) =0, a(3n) = F(3n), a(3n+1) = F(3n+2).
|
|
MAPLE
|
with(combinat): a[1]:=1: for n from 1 to 50 do if fibonacci(n+1)<=a[n] then a[n+1]:=a[n]-fibonacci(n+1) else a[n+1]:=a[n]+fibonacci(n+1) fi od: seq(a[n], n=1..51); (Deutsch)
|
|
CROSSREFS
|
Cf. A000045.
Sequence in context: A022832 A008348 A020836 this_sequence A062627 A011217 A078506
Adjacent sequences: A111463 A111464 A111465 this_sequence A111467 A111468 A111469
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 05 2005
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 11 2005
|
|
|
Search completed in 0.002 seconds
|
