A263280 a(n) = A262507(n) - A263279(n); number of integers k > A259934(n) for which A155043(k) = n = A155043(A259934(n)).

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 3, 2, 2, 4, 4, 0, 1, 0, 1, 1, 3, 2, 1, 1, 3, 2, 4, 1, 0, 0, 1, 4, 2, 2, 0, 1, 0, 1, 4, 6, 5, 5, 4, 2, 2, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 3, 2, 2, 2, 4, 2, 1, 2, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 1, 3, 2, 2, 3, 3, 4, 3, 3, 3, 2, 2, 4

Offset: 0

Author

Antti Karttunen, Nov 24 2015

Keywords

• nonn

Comments

a(n) gives the distance of position of A259934(n) at row n of table A263265 from its right edge.

Links

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

Crossrefs

Cf. A155043, A259934, A262507, A263265, A263279.

Cf. also A262506.

Programs

Scheme

(define (A263280 n) (- (A262507 n) (A263279 n)))

Formula

a(n) = A262507(n) - A263279(n).