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

Author

Antti Karttunen, Sep 07 2016 and Sep 09 2016

Keywords

• nonn

Links

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

Crossrefs

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

Programs

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))))))))))

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.