cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A276613 The infinite trunk of greedy cubes beanstalk: The only infinite sequence such that a(n-1) = a(n) - number of cubes that sum to a(n) with greedy algorithm (A055401).

Original entry on oeis.org

0, 7, 14, 21, 26, 33, 40, 47, 52, 59, 63, 70, 77, 84, 89, 96, 103, 110, 115, 124, 131, 138, 145, 150, 157, 164, 171, 176, 183, 187, 194, 201, 208, 215, 222, 229, 236, 241, 248, 255, 262, 267, 274, 278, 285, 292, 299, 304, 311, 318, 330, 339, 342, 349, 356, 363, 368, 375, 382, 389, 394, 401, 405, 412, 419, 426, 431, 438, 445
Offset: 0

Views

Author

Antti Karttunen, Sep 07 2016

Keywords

Links

Crossrefs

Cf. A055401, A261225, A276612, A276614, A276615 (first differences).
Cf. also A179016, A259934, A276573, A276583, A276623 for similar constructions.

Programs

Formula

a(n) = A276614(A276612(n)).

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

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Sep 07 2016 and Sep 09 2016

Keywords

Links

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.

A276611 After a(0)=0, each n occurs A261229(n) times.

Original entry on oeis.org

0, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9
Offset: 0

Views

Author

Antti Karttunen, Sep 07 2016

Keywords

Comments

Auxiliary function for computing A276612 & A276613.

Links

Crossrefs

Cf. A261228, A261229, A276612, A276613.

Programs

  • Scheme
    (define (A276611 n) (let loop ((k 0)) (if (>= (A261228 (+ 1 k)) n) k (loop (+ 1 k)))))
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.