A341742 - cp's OEIS frontend

A341742 Nodes read by depth in a binary tree defined as: Root = 1; an even node N has a left child N + 1 if N + 1 is not a prime, and an odd node N has a left child sqrt(N + 2) if sqrt(N + 2) is a prime; the right child of a node N is 2*N.

n	a(n)
1	1
2	2
3	4
4	8
5	9
6	16
7	18
8	32
9	36
10	33
11	64
12	72
13	66
14	65
15	128
16	144
17	132
18	130
19	129
20	256
21	145
22	288
23	133
24	264
25	260
26	258
27	512
28	290
29	289
30	576
31	266
32	265
33	528
34	261
35	520
36	259
37	516
38	513
39	1024
40	291
41	580
42	578
43	1152
44	267
45	532
46	530
47	529
48	1056
49	522
50	1040
51	518
52	517
53	1032
54	1026

[1, 2, 4, 8, 9, 16, 18, 32, 36, 33, 64, 72, 66, 65, 128, 144, 132, 130, 129, 256, 145, 288, 133, 264, 260, 258, 512, 290, 289, 576, 266, 265, 528, 261, 520, 259, 516, 513, 1024, 291, 580, 578, 1152, 267, 532, 530, 529, 1056, 522, 1040, 518, 517, 1032, 1026]

cp's OEIS Frontend

A341742 Nodes read by depth in a binary tree defined as: Root = 1; an even node N has a left child N + 1 if N + 1 is not a prime, and an odd node N has a left child sqrt(N + 2) if sqrt(N + 2) is a prime; the right child of a node N is 2*N.

Table of values

List of values