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.

A246259 Square array: row n contains in ascending order all natural numbers k for which A246271(k)+1 = n, i.e., numbers m for which we need n-1 additional iterations of A003961, starting from A003961(m), before the result is 1 modulo 4.

Table of values

n a(n)
1 1
2 3
3 2
4 4
5 7
6 5
7 9
8 8
9 6
10 66
11 10
12 15
13 17
14 70
15 91
16 11
17 18
18 20
19 94
20 197
21 55
22 12
23 19
24 24
25 186
26 259
27 155
28 21
29 13
30 22
31 26
32 187
33 364
34 220
35 84
36 46
37 14
38 28
39 41
40 199
41 377
42 238
43 87
44 184
45 1362
46 16
47 29
48 45
49 237
50 413
51 467
52 189
53 414
54 1981
55 1654
56 23
57 32
58 54
59 262
60 479
61 495
62 309
63 445
64 2378
65 3055
66 1419

List of values

[1, 3, 2, 4, 7, 5, 9, 8, 6, 66, 10, 15, 17, 70, 91, 11, 18, 20, 94, 197, 55, 12, 19, 24, 186, 259, 155, 21, 13, 22, 26, 187, 364, 220, 84, 46, 14, 28, 41, 199, 377, 238, 87, 184, 1362, 16, 29, 45, 237, 413, 467, 189, 414, 1981, 1654, 23, 32, 54, 262, 479, 495, 309, 445, 2378, 3055, 1419]