A263279 a(n) = A263259(A259934(n)); one-based position of A259934(n) at row n of table A263265.

1, 2, 3, 5, 4, 5, 6, 4, 4, 3, 6, 3, 2, 4, 5, 6, 5, 5, 5, 7, 4, 4, 5, 6, 9, 6, 7, 5, 6, 4, 4, 3, 5, 5, 4, 5, 3, 3, 4, 4, 5, 5, 5, 5, 5, 4, 4, 3, 5, 7, 4, 4, 5, 7, 8, 5, 7, 5, 7, 8, 8, 6, 8, 6, 7, 7, 7, 9, 10, 10, 11, 9, 10, 9, 11, 10, 9, 7, 8, 9, 7, 6, 9, 8, 10, 6, 5, 6, 5, 9, 8, 8, 8, 7, 6, 4, 3, 3, 3, 5, 4, 7, 6, 6, 7, 9, 5, 5, 10, 10, 11, 6, 7, 9, 9, 7, 9, 13, 7, 6, 8

Offset: 0

Author

Antti Karttunen, Nov 24 2015

Keywords

• nonn

Comments

a(n) gives the number of integers k <= A259934(n) for which A155043(k) = n = A155043(A259934(n)).

Links

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

Crossrefs

Cf. A155043, A259934, A263259, A263265, A263280.

Cf. also A261103.

Programs

Scheme

(define (A263267 n) (A263259 (A259934 n)))

Formula

a(n) = A263259(A259934(n)).