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.

A338997 Number of (i,j,k) in {1,2,...,n}^3 such that gcd(n,i) = gcd(n,j) = gcd(n,k).

Table of values

n a(n)
1 1
2 2
3 9
4 10
5 65
6 18
7 217
8 74
9 225
10 130
11 1001
12 90
13 1729
14 434
15 585
16 586
17 4097
18 450
19 5833
20 650
21 1953
22 2002
23 10649
24 666
25 8065
26 3458
27 6057
28 2170
29 21953
30 1170
31 27001
32 4682
33 9009
34 8194
35 14105
36 2250
37 46657
38 11666
39 15561
40 4810
41 64001
42 3906
43 74089
44 10010
45 14625
46 21298
47 97337
48 5274
49 74305
50 16130

List of values

[1, 2, 9, 10, 65, 18, 217, 74, 225, 130, 1001, 90, 1729, 434, 585, 586, 4097, 450, 5833, 650, 1953, 2002, 10649, 666, 8065, 3458, 6057, 2170, 21953, 1170, 27001, 4682, 9009, 8194, 14105, 2250, 46657, 11666, 15561, 4810, 64001, 3906, 74089, 10010, 14625, 21298, 97337, 5274, 74305, 16130]