A069199 a(1)=1 a(2)=7 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.

1, 7, 4, 11, 5, 8, 13, 7, 10, 17, 9, 13, 11, 8, 19, 9, 14, 23, 37, 20, 19, 13, 16, 29, 15, 22, 37, 59, 32, 91, 41, 44, 85, 43, 64, 107, 57, 82, 139, 221, 120, 341, 461, 401, 431, 416, 847, 421, 634, 1055, 563, 809, 686, 1495, 727, 1111, 919, 1015, 967, 991, 979, 985

Offset

1,2

Comments

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.

Links

Table of n, a(n) for n=1..62.

Crossrefs

Sequence in context: A103227 A335166 A165415 * A359014 A138339 A107827

Adjacent sequences: A069196 A069197 A069198 * A069200 A069201 A069202

Keyword

easy,nonn

Author

Benoit Cloitre, Apr 11 2002

Status

approved