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.

A362698 For n > 1, if n appears in the sequence, a(n) = a(n-1) - n if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + n. Otherwise a(n+1) = a(n)/(n+1) if (n+1)|a(n), otherwise a(n)*(n+1), a(1) = 1 and a(2) = 1*2.

Table of values

n a(n)
1 1
2 2
3 6
4 24
5 120
6 114
7 798
8 6384
9 57456
10 574560
11 6320160
12 526680
13 6846840
14 489060
15 32604
16 521664
17 8868288
18 159629184
19 8401536
20 168030720
21 3528645120
22 160392960
23 3689038080
24 3689038056
25 92225951400
26 2397874736400
27 64742617882800
28 1812793300718400
29 52571005720833600

List of values

[1, 2, 6, 24, 120, 114, 798, 6384, 57456, 574560, 6320160, 526680, 6846840, 489060, 32604, 521664, 8868288, 159629184, 8401536, 168030720, 3528645120, 160392960, 3689038080, 3689038056, 92225951400, 2397874736400, 64742617882800, 1812793300718400, 52571005720833600]