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.

A255979 a(n) = smallest nonnegative integer solution z to the system of congruences: z == 0 (mod n), z == 1 (mod A038610(n)) if n is in A033948; or z == 0 (mod n), z == -1 (mod A038610(n)) if n is in A033949.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 5
6 1
7 43
8 13
9 249
10 19
11 2291
12 32
13 6397
14 1379
15 3737
16 36599
17 423953
18 4727
19 2579419
20 436486
21 1935539
22 1262563
23 30364247
24 1549256
25 1028011945
26 94055426
27 2754232963
28 230491358
29 77544004469
30 7188548
31 1277242663471
32 4089553744057
33 235736847903

List of values

[0, 0, 1, 1, 5, 1, 43, 13, 249, 19, 2291, 32, 6397, 1379, 3737, 36599, 423953, 4727, 2579419, 436486, 1935539, 1262563, 30364247, 1549256, 1028011945, 94055426, 2754232963, 230491358, 77544004469, 7188548, 1277242663471, 4089553744057, 235736847903]