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.

A110795 Least multiple of n! that leaves a palindrome if trailing zeros are ignored.

Table of values

n a(n)
1 1
2 2
3 6
4 600
5 600
6 25200
7 25200
8 483840
9 698867688960
10 6988676889600
11 293599799539200
12 489718781798400
13 48196817186918400
14 4091568555865190400
15 84446094349064448000
16 2308054967694508032000
17 4070651384548315607040000
18 46671804001710040817664000
19 46671804001710040817664000

List of values

[1, 2, 6, 600, 600, 25200, 25200, 483840, 698867688960, 6988676889600, 293599799539200, 489718781798400, 48196817186918400, 4091568555865190400, 84446094349064448000, 2308054967694508032000, 4070651384548315607040000, 46671804001710040817664000, 46671804001710040817664000]