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!)
A069227 a(1)=1, a(2)=2; a(n+2) = (a(n+1) + a(n))/b(n) where b(n) = gcd(a(n+1) + a(n), 4). 1
1, 2, 3, 5, 2, 7, 9, 4, 13, 17, 15, 8, 23, 31, 27, 29, 14, 43, 57, 25, 41, 33, 37, 35, 18, 53, 71, 31, 51, 41, 23, 16, 39, 55, 47, 51, 49, 25, 37, 31, 17, 12, 29, 41, 35, 19, 27, 23, 25, 12, 37, 49, 43, 23, 33, 14, 47, 61, 27, 22, 49, 71, 30, 101, 131, 58, 189, 247, 109, 89 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A Collatz-Fibonacci mixture.
Conjecture: sequence diverges to infinity (a(500)=151767071).
LINKS
EXAMPLE
a(18)=43, a(19)=57, so gcd(a(18) + a(19), 4) = 4 and hence a(20) = 100/4 = 25.
MATHEMATICA
Nest[Append[#, #/GCD[#, 4] &[#[[-1]] + #[[-2]]]] &, {1, 2}, 68] (* Ivan Neretin, Jun 28 2017 *)
nxt[{a_, b_}]:={b, (a+b)/GCD[a+b, 4]}; NestList[nxt, {1, 2}, 70][[All, 1]] (* Harvey P. Dale, Jan 16 2020 *)
CROSSREFS
Sequence in context: A231233 A174562 A224382 * A117368 A355091 A137826
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 12 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 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)