Breadth-first traversal of a binary tree in which the value at the n-th node is equal to ParentNode()*prime(n-1).

A268878

Breadth-first traversal of a binary tree in which the value at the n-th node is equal to ParentNode()*prime(n-1).

Terms

    a(0) =1a(1) =2a(2) =3a(3) =10a(4) =14a(5) =33a(6) =39a(7) =170a(8) =190a(9) =322a(10) =406a(11) =1023a(12) =1221a(13) =1599a(14) =1677a(15) =7990a(16) =9010a(17) =11210a(18) =11590a(19) =21574a(20) =22862a(21) =29638a(22) =32074a(23) =84909a(24) =91047a(25) =118437a(26) =123321a(27) =164697a(28) =171093a(29) =182793

External references