A276614 The infinite trunk of greedy cubes beanstalk with reversed subsections.

0, 7, 26, 21, 14, 63, 59, 52, 47, 40, 33, 124, 115, 110, 103, 96, 89, 84, 77, 70, 215, 208, 201, 194, 187, 183, 176, 171, 164, 157, 150, 145, 138, 131, 342, 339, 330, 318, 311, 304, 299, 292, 285, 278, 274, 267, 262, 255, 248, 241, 236, 229, 222, 511, 506, 499, 492, 487, 480, 473, 466, 457, 445, 438, 431, 426, 419, 412, 405, 401

Offset

0,2

Links

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

Formula

a(0) = 0; a(1) = 7; for n > 1, if A261225(a(n-1))+1 is not a cube, then a(n) = A261225(a(n-1)), otherwise a(n) = A000578(2+A048766(A261225(a(n-1)))) - 1.

Prog

(Scheme)
(definec (A276614 n) (cond ((zero? n) n) ((= n 1) 7) (else (let ((maybe_next (A261225 (A276614 (- n 1))))) (if (zero? (A010057 (+ 1 maybe_next))) maybe_next (+ -1 (A000578 (+ 2 (A048766 (+ 1 maybe_next))))))))))

Crossrefs

Cf. A000578, A010057, A048766, A261225, A276612, A276613.

Sequence in context: A284054 A284786 A262109 * A230399 A246910 A098127

Adjacent sequences: A276611 A276612 A276613 * A276615 A276616 A276617

Keyword

nonn

Author

Antti Karttunen, Sep 07 2016 and Sep 09 2016

Status

approved