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.

A316744 a(n) is the smallest number having exactly n ways to be represented as sum of at least two consecutive positive integers and expressible as sum of n consecutive positive integers, or 0 if no such number exists.

Table of values

n a(n)
2 9
3 15
4 162
5 45
6 729
7 105
8 900
9 405
10 9765625
11 495
12 1062882
13 9477
14 3969
15 945
16 344373768
17 3825
18 387420489
19 7695
20 34650
21 413343
22 81402749386839761113321
23 7245
24 202500
25 732421875
26 38025
27 25515
28 919973073089479921953602
29 58725
30 0
31 29295
32 23619600
33 473513931
34 60886809
35 17325
36 300189270593998242

List of values

[9, 15, 162, 45, 729, 105, 900, 405, 9765625, 495, 1062882, 9477, 3969, 945, 344373768, 3825, 387420489, 7695, 34650, 413343, 81402749386839761113321, 7245, 202500, 732421875, 38025, 25515, 919973073089479921953602, 58725, 0, 29295, 23619600, 473513931, 60886809, 17325, 300189270593998242]