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.

A332106 Least m > n such that n + ... + m = p*2^k with p prime and k >= 0.

Table of values

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

List of values

[2, 2, 3, 4, 7, 6, 7, 9, 9, 10, 13, 12, 19, 16, 15, 16, 31, 20, 19, 22, 21, 22, 25, 24, 40, 28, 27, 34, 31, 30, 31, 33, 35, 34, 37, 36, 37, 52, 41, 40, 43, 42, 169, 46, 45, 52, 61, 50, 49, 52, 51, 52, 55, 54, 55, 58, 57, 184, 70, 69, 67, 67, 65, 64, 67, 66, 73, 70, 69, 70, 442]

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

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