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.

A187929 Odd numbers k such that 1^((k-1)/2) + 2^((k-1)/2) + .... + (k-1)^((k-1)/2) == 0 (mod k).

Table of values

n a(n)
1 1
2 3
3 5
4 7
5 11
6 13
7 15
8 17
9 19
10 23
11 27
12 29
13 31
14 35
15 37
16 39
17 41
18 43
19 47
20 51
21 53
22 55
23 59
24 61
25 63
26 67
27 71
28 73
29 75
30 77
31 79
32 83
33 85
34 87
35 89
36 91
37 95
38 97
39 99
40 101
41 103
42 107
43 109
44 111
45 113
46 115
47 119
48 123
49 125
50 127
51 131
52 135
53 137
54 139
55 143
56 147
57 149
58 151
59 155
60 157
61 159

List of values

[1, 3, 5, 7, 11, 13, 15, 17, 19, 23, 27, 29, 31, 35, 37, 39, 41, 43, 47, 51, 53, 55, 59, 61, 63, 67, 71, 73, 75, 77, 79, 83, 85, 87, 89, 91, 95, 97, 99, 101, 103, 107, 109, 111, 113, 115, 119, 123, 125, 127, 131, 135, 137, 139, 143, 147, 149, 151, 155, 157, 159]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.