|
%I #8 Nov 29 2016 22:40:02
%S 0,3,7,8,11,15,17,19,23,24,28,31,33,35,39,42,44,47,48,51,55,57,60,63,
%T 66,69,71,73,76,79,80,83,87,89,92,95,97,99,103,105,108,112,115,119,
%U 120,124,127,129,132,135,138,141,143,145,147,151,154,156,159,161,163,167,168,171,175,177,179,183,186,189,192,195,199,201
%N a(n) = largest k for which A260731(k) = n.
%H Antti Karttunen, <a href="/A278519/b278519.txt">Table of n, a(n) for n = 0..11363</a>
%F a(0) = 0; for n > 0, a(n) = A278517(1+n)-1.
%F For all n >= 0, A260731(a(n)) = n.
%o (Scheme) (define (A278519 n) (if (zero? n) n (+ -1 (A278517 (+ 1 n)))))
%Y Cf. A260731 (a left inverse), A278517, A278518 (first differences, after its initial 1), A278522.
%K nonn
%O 0,2
%A _Antti Karttunen_, Nov 28 2016
|
