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.

A348433 a(1) = 1; a(n+1) = 2*a(n) if the digit sum of a(n) is already in the sequence, otherwise a(n+1) = digitsum(a(n)).

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 16
6 7
7 14
8 5
9 10
10 20
11 40
12 80
13 160
14 320
15 640
16 1280
17 11
18 22
19 44
20 88
21 176
22 352
23 704
24 1408
25 13
26 26
27 52
28 104
29 208
30 416
31 832
32 1664
33 17
34 34
35 68
36 136
37 272
38 544
39 1088
40 2176
41 4352
42 8704
43 19
44 38
45 76
46 152
47 304
48 608
49 1216
50 2432
51 4864
52 9728
53 19456
54 25
55 50
56 100
57 200

List of values

[1, 2, 4, 8, 16, 7, 14, 5, 10, 20, 40, 80, 160, 320, 640, 1280, 11, 22, 44, 88, 176, 352, 704, 1408, 13, 26, 52, 104, 208, 416, 832, 1664, 17, 34, 68, 136, 272, 544, 1088, 2176, 4352, 8704, 19, 38, 76, 152, 304, 608, 1216, 2432, 4864, 9728, 19456, 25, 50, 100, 200]