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-2 of 2 results.

A269831 Least term of height n in Recamán's sequence A005132.

Original entry on oeis.org

1, 2, 6, 8, 14, 26, 4, 47, 92, 111, 181, 150, 371, 361, 781, 828, 366, 19
Offset: 1

Views

Author

Danny Rorabaugh, Mar 05 2016

Keywords

Comments

The height (A064289) of a term in Recamán's sequence (A005132) = number of addition steps - number of subtraction steps to produce it.

Links

Crossrefs

Cf. A064289, A064290, A064293, A269830, A269832.

A269832 Greatest term of height n in Recamán's sequence A005132.

Original entry on oeis.org

1, 3, 7, 13, 25, 46, 91, 164, 286, 515, 962, 1744, 3137, 5810, 10319, 18953, 35079, 63237
Offset: 1

Views

Author

Danny Rorabaugh, Mar 05 2016

Keywords

Comments

The height (A064289) of a term in Recamán's sequence (A005132) = number of addition steps - number of subtraction steps to produce it.

Links

Crossrefs

Cf. A064289, A064290, A064293, A269830, A269831.
Showing 1-2 of 2 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.