A262902 a(n) = A049820(A045765(n)); parent-nodes of the leaves of the tree generated by edge-relation A049820(child) = parent.

5, 4, 11, 17, 14, 16, 22, 22, 29, 27, 35, 32, 41, 46, 44, 46, 51, 48, 57, 57, 58, 65, 62, 70, 69, 77, 81, 80, 92, 91, 101, 96, 107, 102, 111, 110, 111, 119, 118, 114, 129, 120, 129, 130, 128, 128, 139, 141, 138, 147, 144, 155, 148, 161, 158, 165, 152, 162, 166, 169, 162, 176, 181, 191, 187, 199, 192, 201, 214, 215, 222, 216, 227, 224, 231, 239, 238, 238, 249, 234, 249, 247, 255, 255

Offset: 1

Author

Antti Karttunen, Oct 06 2015

Keywords

• nonn

Comments

The sequence is computed for each leaf of the tree (A045765), ordered by their magnitude, and it contains duplicates.

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10000

Crossrefs

Row 2 of A262898.

Cf. A262901 (same sequence sorted into ascending order, with duplicates removed).

Cf. A049820, A045765.

Cf. also A257507.

Programs

Scheme

(define (A262902 n) (A049820 (A045765 n)))

Formula

a(n) = A049820(A045765(n)).