a(1) = 1; a(n+1) is the smallest triangular number such that the greatest common divisor gcd(a(n+1), a(n)) is a triangular number itself.
A093799
a(1) = 1; a(n+1) is the smallest triangular number such that the greatest common divisor gcd(a(n+1), a(n)) is a triangular number itself.
Terms
- a(0) =1a(1) =3a(2) =6a(3) =15a(4) =21a(5) =36a(6) =55a(7) =78a(8) =105a(9) =120a(10) =153a(11) =190a(12) =210a(13) =231a(14) =276a(15) =325a(16) =378a(17) =435a(18) =465a(19) =528a(20) =595a(21) =666a(22) =741a(23) =820a(24) =903a(25) =990a(26) =1035a(27) =1128a(28) =1225a(29) =1326
External references
- oeis: A093799