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.

A381291 Number of subsets of 8 integers between 1 and n such that their sum is 0 modulo n.

Table of values

n a(n)
9 1
10 5
11 15
12 43
13 99
14 217
15 429
16 809
17 1430
18 2438
19 3978
20 6310
21 9690
22 14550
23 21318
24 30666
25 43263
26 60115
27 82225
28 111041
29 148005
30 195143
31 254475
32 328755
33 420732
34 534076
35 672452
36 840652
37 1043460
38 1287036
39 1577532
40 1922740
41 2330445
42 2810385
43 3372291
44 4028183
45 4790071

List of values

[1, 5, 15, 43, 99, 217, 429, 809, 1430, 2438, 3978, 6310, 9690, 14550, 21318, 30666, 43263, 60115, 82225, 111041, 148005, 195143, 254475, 328755, 420732, 534076, 672452, 840652, 1043460, 1287036, 1577532, 1922740, 2330445, 2810385, 3372291, 4028183, 4790071]

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

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