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.

A380697 Frobenius number of the set S = {e_i+2; 1 <= i <= m}, where the e_i are the exponents in the binary expansion n = Sum_{i=1..m} 2^e_i, or 0 if GCD(S) = A326674(2*n) > 1.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 5
7 1
8 0
9 3
10 7
11 1
12 11
13 3
14 2
15 1
16 0
17 0
18 0
19 1
20 0
21 0
22 5
23 1
24 19
25 3
26 7
27 1
28 7
29 3
30 2
31 1
32 0
33 5
34 11
35 1
36 17
37 5
38 5
39 1
40 23
41 3
42 4
43 1
44 6
45 3
46 2
47 1
48 29
49 5
50 11
51 1
52 9
53 5
54 5
55 1
56 9
57 3
58 4
59 1
60 3
61 3
62 2
63 1
64 0
65 0
66 13
67 1
68 0
69 0
70 5
71 1
72 27
73 3
74 7
75 1
76 11
77 3
78 2
79 1
80 0
81 0
82 13
83 1

List of values

[0, 0, 1, 0, 0, 5, 1, 0, 3, 7, 1, 11, 3, 2, 1, 0, 0, 0, 1, 0, 0, 5, 1, 19, 3, 7, 1, 7, 3, 2, 1, 0, 5, 11, 1, 17, 5, 5, 1, 23, 3, 4, 1, 6, 3, 2, 1, 29, 5, 11, 1, 9, 5, 5, 1, 9, 3, 4, 1, 3, 3, 2, 1, 0, 0, 13, 1, 0, 0, 5, 1, 27, 3, 7, 1, 11, 3, 2, 1, 0, 0, 13, 1]