login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 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; refs; listen; history; text; internal format)
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
CROSSREFS
Sequence in context: A315835 A109605 A331860 * A069136 A348368 A277137
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Apr 11 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)