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.

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.

Table of values

n a(n)
1 0
2 6
3 153
4 66
5 0
6 3916
7 0
8 1770
9 2556
10 327645
11 0
12 1540
13 0
14 893862621
15 8199225
16 17766
17 0
18 76636
19 0
20 12720
21 662976
22 2096128
23 0
24 10296
25 3357936
26 416798777159765703
27 6221628
28 3611328
29 0
30 1734453
31 0
32 303810
33 111576864636
34 1420010137134674578503
35 18051523357140153

List of values

[0, 6, 153, 66, 0, 3916, 0, 1770, 2556, 327645, 0, 1540, 0, 893862621, 8199225, 17766, 0, 76636, 0, 12720, 662976, 2096128, 0, 10296, 3357936, 416798777159765703, 6221628, 3611328, 0, 1734453, 0, 303810, 111576864636, 1420010137134674578503, 18051523357140153]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.