login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A278519
a(n) = largest k for which A260731(k) = n.
6
0, 3, 7, 8, 11, 15, 17, 19, 23, 24, 28, 31, 33, 35, 39, 42, 44, 47, 48, 51, 55, 57, 60, 63, 66, 69, 71, 73, 76, 79, 80, 83, 87, 89, 92, 95, 97, 99, 103, 105, 108, 112, 115, 119, 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
OFFSET
0,2
LINKS
FORMULA
a(0) = 0; for n > 0, a(n) = A278517(1+n)-1.
For all n >= 0, A260731(a(n)) = n.
PROG
(Scheme) (define (A278519 n) (if (zero? n) n (+ -1 (A278517 (+ 1 n)))))
CROSSREFS
Cf. A260731 (a left inverse), A278517, A278518 (first differences, after its initial 1), A278522.
Sequence in context: A078466 A047528 A069122 * A007970 A255342 A332572
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 28 2016
STATUS
approved