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.

A094252 a(n) = partition(n) mod prime(n).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 7
6 11
7 15
8 3
9 7
10 13
11 25
12 3
13 19
14 6
15 35
16 19
17 2
18 19
19 21
20 59
21 62
22 54
23 10
24 62
25 18
26 12
27 23
28 80
29 96
30 67
31 111
32 96
33 5
34 78
35 132
36 8
37 128
38 98
39 123
40 143
41 12
42 141
43 40
44 98
45 90
46 88
47 53
48 93
49 97
50 187
51 186
52 47
53 2
54 117
55 241
56 34
57 27
58 51
59 266
60 108
61 259
62 115
63 278
64 30
65 281
66 227
67 244
68 141

List of values

[1, 2, 3, 5, 7, 11, 15, 3, 7, 13, 25, 3, 19, 6, 35, 19, 2, 19, 21, 59, 62, 54, 10, 62, 18, 12, 23, 80, 96, 67, 111, 96, 5, 78, 132, 8, 128, 98, 123, 143, 12, 141, 40, 98, 90, 88, 53, 93, 97, 187, 186, 47, 2, 117, 241, 34, 27, 51, 266, 108, 259, 115, 278, 30, 281, 227, 244, 141]

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

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