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.

A319922 Number of ways of writing n as a sum of exactly 10 powers of 2.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 5, 6, 5, 6, 6, 7, 8, 9, 8, 10, 9, 10, 11, 13, 11, 14, 12, 13, 12, 15, 12, 16, 14, 16, 14, 18, 15, 19, 17, 21, 18, 22, 17, 22, 18, 22, 19, 25, 19, 24, 20, 25, 21, 28, 21, 27, 21, 26, 19, 27, 20, 26, 19]

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

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