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.

A263319 a(n) = pi(n^2)*phi(n)/2, where pi(x) denotes the number of primes not exceeding x, and phi(.) is Euler's totient function given by A000010.

Table of values

n a(n)
1 0
2 1
3 4
4 6
5 18
6 11
7 45
8 36
9 66
10 50
11 150
12 68
13 234
14 132
15 192
16 216
17 488
18 198
19 648
20 312
21 510
22 460
23 1089
24 420
25 1140
26 732
27 1161
28 822
29 2044
30 616
31 2430
32 1376
33 1810
34 1528
35 2400
36 1260
37 3942
38 2052
39 2880
40 2008
41 5260
42 1644
43 5943
44 2950
45 3672
46 3509
47 7567
48 2736
49 7497
50 3670

List of values

[0, 1, 4, 6, 18, 11, 45, 36, 66, 50, 150, 68, 234, 132, 192, 216, 488, 198, 648, 312, 510, 460, 1089, 420, 1140, 732, 1161, 822, 2044, 616, 2430, 1376, 1810, 1528, 2400, 1260, 3942, 2052, 2880, 2008, 5260, 1644, 5943, 2950, 3672, 3509, 7567, 2736, 7497, 3670]