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.

A260531 a(n) = (2^p+1)^(p-1) modulo p^2, where p is prime(n).

Table of values

n a(n)
1 1
2 0
3 21
4 1
5 45
6 79
7 120
8 305
9 484
10 697
11 404
12 186
13 1354
14 603
15 612
16 2757
17 945
18 3051
19 3552
20 498
21 950
22 1186
23 2657
24 1781
25 6403
26 9192
27 8035
28 1927
29 2181
30 2713
31 6097
32 2621
33 10139
34 3476
35 10878
36 8608
37 22609
38 21028
39 24550
40 19031
41 1
42 12852
43 33426
44 27793
45 34279
46 11543

List of values

[1, 0, 21, 1, 45, 79, 120, 305, 484, 697, 404, 186, 1354, 603, 612, 2757, 945, 3051, 3552, 498, 950, 1186, 2657, 1781, 6403, 9192, 8035, 1927, 2181, 2713, 6097, 2621, 10139, 3476, 10878, 8608, 22609, 21028, 24550, 19031, 1, 12852, 33426, 27793, 34279, 11543]