login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Least monotonic left inverse for A261089; a(n) = largest k for which A261089(k) <= n.
2

%I #6 Nov 27 2015 00:17:33

%S 0,1,1,2,2,3,3,4,4,4,4,4,4,5,5,5,5,6,6,7,7,7,7,8,8,8,8,9,9,10,10,11,

%T 11,11,11,12,12,13,13,13,13,14,14,15,15,15,15,15,15,15,15,16,16,17,17,

%U 17,17,18,18,19,19,20,20,20,20,21,21,22,22,22,22,23,23,24,24,24,24,25,25,26

%N Least monotonic left inverse for A261089; a(n) = largest k for which A261089(k) <= n.

%H Antti Karttunen, <a href="/A263089/b263089.txt">Table of n, a(n) for n = 0..12332</a>

%o (Scheme, with _Antti Karttunen_'s IntSeq-library)

%o (define A263089 (LEFTINV-LEASTMONO 0 0 A261089))

%Y Cf. A155043, A261089, A263259.

%K nonn

%O 0,4

%A _Antti Karttunen_, Nov 24 2015