a(n) is the smallest triangular number T(k) such that both it and its successor T(k+1) have exactly 2n divisors, or 0 if no such pair of consecutive triangular numbers exists.
A319036
a(n) is the smallest triangular number T(k) such that both it and its successor T(k+1) have exactly 2n divisors, or 0 if no such pair of consecutive triangular numbers exists.
Terms
- a(0) =0a(1) =6a(2) =153a(3) =66a(4) =0a(5) =3916a(6) =0a(7) =1770a(8) =2556a(9) =327645a(10) =0a(11) =1540a(12) =0a(13) =893862621a(14) =8199225a(15) =17766a(16) =0a(17) =76636a(18) =0a(19) =12720a(20) =662976a(21) =2096128a(22) =0a(23) =10296a(24) =3357936a(26) =6221628a(27) =3611328a(28) =0a(29) =1734453a(30) =0
External references
- oeis: A319036