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!)
A349982 a(n) = 199 + (a(n-1)+a(n-2))/gcd(a(n-1),a(n-2)), a(0)=1 and a(1)=2. 1
1, 2, 202, 301, 702, 1202, 1151, 2552, 3902, 3426, 3863, 7488, 11550, 3372, 2686, 3228, 3156, 731, 4086, 5016, 1716, 250, 1182, 915, 898, 2012, 1654, 2032, 2042, 2236, 2338, 2486, 2611, 5296, 8106, 6900, 2700, 231, 1176, 266, 302, 483, 984, 688, 408, 336, 230 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
The sequence repeats periodically with a period of 2920. The first repeating term is a(2785) = 288 = a(5705).
LINKS
A. Santi on math.stackexchange.com, Investigating the recurrence relation ...
EXAMPLE
a(2) = 199+(1+2)/gcd(1,2) = 199+3 = 202,
a(3) = 199+(2+202)/gcd(2,202) = 199+102 = 301.
MATHEMATICA
Nest[Append[#, 199 + Total[#[[-2 ;; -1]]]/(GCD @@ #[[-2 ;; -1]])] &, {1, 2}, 45] (* Michael De Vlieger, Jan 08 2022 *)
CROSSREFS
Sequence in context: A356024 A180301 A203773 * A209185 A216608 A238819
KEYWORD
nonn,easy
AUTHOR
Augusto Santi, Jan 08 2022
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 May 7 12:11 EDT 2024. Contains 372303 sequences. (Running on oeis4.)