OFFSET
0,2
COMMENTS
The binary tree, read from left to right in the order of increasing depth n, is the positive integer sequence A000027. The first 65 numbers in the binary tree are shown in the figure below.
1
/ \
2 3
/ \ / \
4 5 6 7
/ / / \ / \
8 9 10 11 12 13
/ / / \ / \ / /
14 15 16 17 18 19 20 21
/ \ / / / / / \ / \ /
22 23 24 25 26 27 28 29 30 31 32
/ / / / \ / / / \ / \ / / / \
33 34 35 36 37 38 39 40 41 42 43 44 45 46 47
/ / / / / \ / / / / / \ / \ / / / /
48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65
Every node has either one child or two children and, thus, the binary tree has no leaves. All left children except 2 are composites and all odd primes are right children.
a(n) for n >= 1 in this sequence is the number of terms in A090532 having the value of n.
The left side of the binary tree is A025003 with a(1) = 1. A025003 is the smallest number that takes n steps to reach 1 when map A062298 is applied to an integer.
Starting from the root, there is only one path in which all nodes have two children. The path is 1 -> 3 -> 6 -> 11 -> 19 -> 29 - > 43 -> 60 -> 83, which contains 9 nodes.
LINKS
Michael De Vlieger, Table of n, a(n) for n = 0..150
MATHEMATICA
c = q = 0; w = {}; Do[Set[a[i], If[PrimeQ[i], c++, a[i - c]]]; q++; If[a[i] == 0, AppendTo[w, q]; q = 0], {i, 2, 10^5}]; Most[w] (* Michael De Vlieger, Nov 04 2021 *)
PROG
(Python)
from sympy import primepi
def depth(k):
d = 0
while k > 1:
k -= primepi(k)
d += 1
return d
m = 1
for n in range (0, 101):
a = 0
while depth(m + a) == n:
a += 1
print(a)
m += a
CROSSREFS
KEYWORD
nonn
AUTHOR
Ya-Ping Lu, Oct 17 2020
STATUS
approved