|
Search: id:A069197
|
|
|
| A069197 |
|
a(1)=1 a(2)=4 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise. |
|
+0
1
|
|
| 1, 4, 5, 3, 4, 7, 11, 6, 17, 23, 20, 43, 21, 32, 53, 85, 46, 131, 59, 95, 77, 86, 163, 83, 82, 55, 137, 64, 67, 131, 66, 197, 263, 230, 493, 241, 367, 304, 671, 325, 332, 219, 551, 385, 312, 697, 1009, 853, 931, 892, 1823, 905, 1364, 2269, 1211, 1160, 2371, 1177
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A Collatz-Fibonacci mixture. Does this sequence diverge to infinity? Conjecture : if a(1)=1 and a(2)=2 sequence is constant = 1, if a(2)=5 sequence is cyclic = (5,2,7,3) but if a(2)=m, different from 2 or 5, sequence diverges.
|
|
CROSSREFS
|
Sequence in context: A057113 A060134 A138753 this_sequence A021692 A107793 A004493
Adjacent sequences: A069194 A069195 A069196 this_sequence A069198 A069199 A069200
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 11 2002
|
|
|
Search completed in 0.002 seconds
|
