|
Search: id:A104220
|
|
|
| A104220 |
|
a(n) = Fibonacci[n]+1-Mod[Fibonacci[n],2] |
|
+0
1
|
|
| 1, 1, 1, 3, 3, 5, 9, 13, 21, 35, 55, 89, 145, 233, 377, 611, 987, 1597, 2585, 4181, 6765, 10947, 17711, 28657, 46369, 75025, 121393, 196419, 317811, 514229, 832041, 1346269, 2178309, 3524579, 5702887, 9227465, 14930353, 24157817, 39088169
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
All-odd Fibonacci sequence.
|
|
FORMULA
|
G.f.:(1-x^4-x^2)/((x-1)*(-1+x^2+x)*(x^2+x+1)) [From Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009]
|
|
MATHEMATICA
|
fib[n_Integer?Positive] := fib[n] = fib[n - 1] + fib[n - 2] fib[0] = 0; fib[1] = 1 a = Table[fib[n] + 1 - Mod[fib[n], 2], {n, 0, 100}]
|
|
CROSSREFS
|
Sequence in context: A117433 A159284 A078028 this_sequence A137202 A146926 A000198
Adjacent sequences: A104217 A104218 A104219 this_sequence A104221 A104222 A104223
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Mar 14 2005
|
|
|
Search completed in 0.002 seconds
|
