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.

A327449 Number of ways the first n primes can be partitioned into three sets with equal sums.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 3
11 0
12 0
13 0
14 0
15 0
16 423
17 0
18 2624
19 0
20 13474
21 0
22 0
23 0
24 611736
25 0
26 4169165
27 0
28 30926812
29 0
30 214975174
31 0
32 1590432628
33 0
34 11431365932
35 0
36 83946004461
37 0
38 0
39 0
40 4615654888831
41 0
42 35144700468737
43 0
44 271133285220726
45 0
46 2103716957561013
47 0
48 0
49 0
50 0
51 0
52 990170108748552983
53 0
54 7855344215856348141

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 423, 0, 2624, 0, 13474, 0, 0, 0, 611736, 0, 4169165, 0, 30926812, 0, 214975174, 0, 1590432628, 0, 11431365932, 0, 83946004461, 0, 0, 0, 4615654888831, 0, 35144700468737, 0, 271133285220726, 0, 2103716957561013, 0, 0, 0, 0, 0, 990170108748552983, 0, 7855344215856348141]

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

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