The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277815 a(n) = the largest k < n for which A264977(k) = A264977(n), or 0 if no such k exists. 6
 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 7, 0, 5, 0, 0, 0, 0, 0, 11, 4, 9, 14, 0, 0, 17, 10, 15, 0, 13, 0, 0, 0, 0, 0, 19, 0, 25, 22, 3, 8, 29, 18, 23, 28, 21, 0, 0, 0, 0, 34, 27, 20, 37, 30, 47, 0, 33, 26, 31, 0, 41, 0, 0, 0, 0, 0, 35, 0, 57, 38, 55, 0, 0, 50, 39, 44, 53, 6, 43, 16, 0, 58, 79, 36, 61, 46, 0, 56, 73, 42, 71, 0, 45, 0, 0, 0, 0, 0, 51 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,11 LINKS Antti Karttunen, Table of n, a(n) for n = 0..65537 FORMULA For all n >= 0, a(A277816(n)) = n. PROG (Scheme) (define (A277815 n) (if (zero? n) n (let ((v (A264977 n))) (let loop ((k (- n 1))) (cond ((zero? k) 0) ((= v (A264977 k)) k) (else (loop (- k 1)))))))) CROSSREFS Cf. A264977, A277695, A277814, A277817 (the positions of zeros). Left inverse of A277816. Sequence in context: A260129 A101689 A175292 * A229178 A019667 A098198 Adjacent sequences:  A277812 A277813 A277814 * A277816 A277817 A277818 KEYWORD nonn AUTHOR Antti Karttunen, Nov 06 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 18 09:15 EST 2020. Contains 332011 sequences. (Running on oeis4.)