|
Search: id:A069198
|
|
|
| A069198 |
|
a(1)=1 a(2)=6 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, 6, 7, 13, 10, 23, 11, 17, 14, 31, 15, 23, 19, 14, 11, 25, 12, 37, 49, 43, 46, 89, 45, 67, 56, 41, 97, 46, 143, 63, 103, 83, 62, 145, 69, 107, 88, 65, 51, 58, 109, 167, 92, 259, 117, 188, 305, 493, 266, 253, 173, 142, 105, 247, 176, 141, 317, 229, 182, 137, 319
(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: A105329 A155942 A109605 this_sequence A069136 A047335 A127020
Adjacent sequences: A069195 A069196 A069197 this_sequence A069199 A069200 A069201
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 11 2002
|
|
|
Search completed in 0.002 seconds
|
