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.

A076039 Start with 1. Multiply or divide by n accordingly as a(n-1) is smaller or greater than n and then take the integer value (this is to ensure that a(n) > 0 for all n).

Table of values

n a(n)
1 1
2 2
3 6
4 1
5 5
6 30
7 4
8 32
9 3
10 30
11 2
12 24
13 1
14 14
15 210
16 13
17 221
18 12
19 228
20 11
21 231
22 10
23 230
24 9
25 225
26 8
27 216
28 7
29 203
30 6
31 186
32 5
33 165
34 4
35 140
36 3
37 111
38 2
39 78
40 1
41 41
42 1722
43 40
44 1760
45 39
46 1794
47 38
48 1824
49 37
50 1850
51 36
52 1872
53 35
54 1890
55 34
56 1904
57 33
58 1914
59 32
60 1920
61 31
62 1922
63 30
64 1920

List of values

[1, 2, 6, 1, 5, 30, 4, 32, 3, 30, 2, 24, 1, 14, 210, 13, 221, 12, 228, 11, 231, 10, 230, 9, 225, 8, 216, 7, 203, 6, 186, 5, 165, 4, 140, 3, 111, 2, 78, 1, 41, 1722, 40, 1760, 39, 1794, 38, 1824, 37, 1850, 36, 1872, 35, 1890, 34, 1904, 33, 1914, 32, 1920, 31, 1922, 30, 1920]