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.

A371359 a(1)=1; for n>1, a(n) = a(n-1) / k if there exists an unused positive integer k (choose the smallest) such that a(n) is a distinct positive integer; otherwise a(n) = a(n-1) * k if the same conditions apply.

Table of values

n a(n)
1 1
2 2
3 6
4 24
5 4
6 20
7 140
8 14
9 112
10 8
11 72
12 3
13 33
14 396
15 22
16 286
17 13
18 195
19 5
20 80
21 1360
22 68
23 1292
24 38
25 798
26 21
27 483
28 7
29 175
30 4550
31 130
32 3510
33 117
34 3276
35 91
36 2639
37 29
38 899
39 28768
40 496
41 16368
42 372
43 13764
44 222
45 8880
46 185
47 7585
48 41
49 1722
50 74046
51 903
52 40635
53 645
54 29670

List of values

[1, 2, 6, 24, 4, 20, 140, 14, 112, 8, 72, 3, 33, 396, 22, 286, 13, 195, 5, 80, 1360, 68, 1292, 38, 798, 21, 483, 7, 175, 4550, 130, 3510, 117, 3276, 91, 2639, 29, 899, 28768, 496, 16368, 372, 13764, 222, 8880, 185, 7585, 41, 1722, 74046, 903, 40635, 645, 29670]