A293517 - cp's OEIS frontend

A293517 a(n) = A293518(n) - A293519(n); how many more surviving even nodes than surviving (but not bifurcating) odd nodes there are at generation n in the binary tree of persistently squarefree numbers.

n	a(n)
0	0
1	1
2	1
3	1
4	1
5	2
6	1
7	3
8	4
9	5
10	9
11	8
12	10
13	20
14	17
15	36
16	32
17	50
18	66
19	83
20	118
21	171
22	219
23	291
24	410
25	511
26	730
27	952
28	1325
29	1665
30	2389
31	3100
32	4147
33	5631
34	7591
35	10093
36	13756
37	18390
38	24540
39	33288
40	44391
41	60052
42	80291
43	108096
44	145226
45	194764
46	262091
47	352096
48	473452
49	635336
50	854332
51	1147668

[0, 1, 1, 1, 1, 2, 1, 3, 4, 5, 9, 8, 10, 20, 17, 36, 32, 50, 66, 83, 118, 171, 219, 291, 410, 511, 730, 952, 1325, 1665, 2389, 3100, 4147, 5631, 7591, 10093, 13756, 18390, 24540, 33288, 44391, 60052, 80291, 108096, 145226, 194764, 262091, 352096, 473452, 635336, 854332, 1147668]

cp's OEIS Frontend

A293517 a(n) = A293518(n) - A293519(n); how many more surviving even nodes than surviving (but not bifurcating) odd nodes there are at generation n in the binary tree of persistently squarefree numbers.

Table of values

List of values