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.

A232097 a(n) = least k such that 1+2+3+...+k (k-th triangular number) is a multiple of n!; a(n) = least k such that A232096(k) >= n.

Table of values

n a(n)
1 1
2 3
3 3
4 15
5 15
6 224
7 224
8 4095
9 76544
10 512000
11 9511424
12 20916224
13 410572799
14 672358400
15 2985984000
16 1004293914624
17 1004293914624
18 78942076928000
19 610877575397375
20 83179139563520000
21 490473044848410624
22 6878928869130239999
23 185974097225789210624
24 1708887984313466880000
25 68817755280574852890624

List of values

[1, 3, 3, 15, 15, 224, 224, 4095, 76544, 512000, 9511424, 20916224, 410572799, 672358400, 2985984000, 1004293914624, 1004293914624, 78942076928000, 610877575397375, 83179139563520000, 490473044848410624, 6878928869130239999, 185974097225789210624, 1708887984313466880000, 68817755280574852890624]