cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A349982 a(n) = 199 + (a(n-1)+a(n-2))/gcd(a(n-1),a(n-2)), a(0)=1 and a(1)=2.

Original entry on oeis.org

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
Offset: 0

Views

Author

Augusto Santi, Jan 08 2022

Keywords

Comments

The sequence repeats periodically with a period of 2920. The first repeating term is a(2785) = 288 = a(5705).

Examples

			a(2) = 199+(1+2)/gcd(1,2) = 199+3 = 202,
a(3) = 199+(2+202)/gcd(2,202) = 199+102 = 301.
		

Programs

  • Mathematica
    Nest[Append[#, 199 + Total[#[[-2 ;; -1]]]/(GCD @@ #[[-2 ;; -1]])] &, {1, 2}, 45] (* Michael De Vlieger, Jan 08 2022 *)