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.

A082386 Let S(0) = {1} and for k >= 1, let S(k) = {S(k-1), S(k-1), 2T}, where T = sum of terms in S(k-1). Sequence is S(infinity).

Table of values

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

List of values

[1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 128, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 512, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 128, 1, 1, 2, 1, 1, 2]