Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

0,3

a(n) = least number k for which A263254(k) = n.

Also positions of records in A263254, thus the sequence is strictly increasing.

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

(Scheme, three alternatives implementations)

(define A263257 (RECORD-POS 0 0 A263254)) ;; Uses Antti Karttunen's IntSeq-library

(define (A263257 n) (let loop ((k 0)) (if (= (A263254 k) n) k (loop (+ 1 k)))))

(define (A263257 n) (A263255bi n 1)) ;; A263255bi given in A263255.

Cf. A049820, A259934, A263254, A263258.

First column of array A263255.

Sequence in context: A052333 A074106 A002261 * A261456 A154524 A184805

Adjacent sequences: A263254 A263255 A263256 * A263258 A263259 A263260

nonn

Antti Karttunen, Nov 07 2015

approved