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.

A074484 a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482).

Table of values

n a(n)
0 38606
1 38606
2 38606
3 8
4 48
5 48
6 192
7 192
8 304
9 96
10 16
11 304
12 304
13 72
14 44
15 160
16 1170558326
17 160
18 96
19 128
20 190
21 392472
22 1980
23 6560
24 3304
25 32
26 6560
27 6560
28 114
29 22348
30 6240
31 230
32 392472
33 5920
34 5920
35 5920
36 592362276
37 592362276
38 18154867024
39 18154867024

List of values

[38606, 38606, 38606, 8, 48, 48, 192, 192, 304, 96, 16, 304, 304, 72, 44, 160, 1170558326, 160, 96, 128, 190, 392472, 1980, 6560, 3304, 32, 6560, 6560, 114, 22348, 6240, 230, 392472, 5920, 5920, 5920, 592362276, 592362276, 18154867024, 18154867024]