login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

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 A134258

Adjacent sequences:  A278516 A278517 A278518 * A278520 A278521 A278522

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 28 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 07:57 EDT 2018. Contains 316276 sequences. (Running on oeis4.)