A348483 - cp's OEIS frontend

A348483 a(1) = 1; if the sum of the digits of 2a(n-1) + 1 is not yet in the sequence then a(n) = 2a(n-1) + 1; otherwise a(n) is the sum of digits of a(n-1).

n	a(n)
1	1
2	3
3	7
4	15
5	6
6	13
7	4
8	9
9	19
10	10
11	21
12	43
13	87
14	175
15	351
16	703
17	1407
18	12
19	25
20	51
21	103
22	207
23	415
24	831
25	1663
26	16
27	33
28	67
29	135
30	271
31	543
32	1087
33	2175
34	4351
35	8703
36	18
37	37
38	75
39	151
40	303
41	607
42	1215
43	2431
44	4863
45	9727
46	19455
47	24
48	49
49	99
50	199
51	399
52	799
53	1599
54	3199
55	22
56	45

[1, 3, 7, 15, 6, 13, 4, 9, 19, 10, 21, 43, 87, 175, 351, 703, 1407, 12, 25, 51, 103, 207, 415, 831, 1663, 16, 33, 67, 135, 271, 543, 1087, 2175, 4351, 8703, 18, 37, 75, 151, 303, 607, 1215, 2431, 4863, 9727, 19455, 24, 49, 99, 199, 399, 799, 1599, 3199, 22, 45]

cp's OEIS Frontend

A348483 a(1) = 1; if the sum of the digits of 2a(n-1) + 1 is not yet in the sequence then a(n) = 2a(n-1) + 1; otherwise a(n) is the sum of digits of a(n-1).

Table of values

List of values

cp's OEIS Frontend

A348483 a(1) = 1; if the sum of the digits of 2*a(n-1) + 1 is not yet in the sequence then a(n) = 2*a(n-1) + 1; otherwise a(n) is the sum of digits of a(n-1).

Table of values

List of values

A348483 a(1) = 1; if the sum of the digits of 2a(n-1) + 1 is not yet in the sequence then a(n) = 2a(n-1) + 1; otherwise a(n) is the sum of digits of a(n-1).