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.

A282434 Positions of records in A282442.

Original entry on oeis.org

1, 2, 4, 5, 8, 11, 12, 14, 18, 19, 21, 24, 25, 28, 34, 40, 41, 50, 54, 55, 60, 63, 70, 76, 86, 87, 90, 96, 99, 107, 118, 119, 132, 139, 152, 164, 181, 184, 190, 197, 200, 208, 220, 233, 236, 237, 242, 252, 269, 272, 285, 288, 298, 299, 324, 328, 341, 354, 357
Offset: 1

Views

Author

Peter Kagey, Feb 15 2017

Keywords

Comments

Equivalently, positions of records in A282443.

Links

Crossrefs

Cf. A282442.

A282573 The number of steps taken on a staircase of n steps during the following routine: Take steps of length 1 up a staircase until you can't step any further, then take steps of length 2 down until you can't step any further, and so on.

Original entry on oeis.org

1, 3, 4, 7, 10, 12, 13, 19, 20, 23, 26, 32, 33, 39, 40, 41, 46, 53, 57, 56, 63, 65, 66, 77, 81, 80, 83, 94, 90, 97, 100, 102, 103, 117, 118, 117, 128, 126, 127, 138, 149, 151, 152, 162, 163, 160, 161, 175, 176, 194, 195, 186, 197, 212, 216, 215, 218, 220, 221
Offset: 1

Views

Author

Peter Kagey, Feb 18 2017

Keywords

Examples

			For n = 4:
step size 1: 0 -> 1 -> 2 -> 3 -> 4 (four steps);
step size 2: 4 -> 2 -> 0 (two steps);
step size 3: 0 -> 3 (one step).
Because the walker cannot take four steps down, a(4) = 4 + 2 + 1 = 7.

Links

Crossrefs

Cf. A282442, A282443.

A282574 The final position on a staircase of n steps during the following routine: Take steps of length 1 up a staircase until you can't step any further, then take steps of length 2 down until you can't step any further, and so on.

Original entry on oeis.org

1, 0, 1, 3, 5, 2, 3, 0, 1, 7, 9, 2, 3, 0, 1, 6, 11, 17, 1, 15, 19, 6, 9, 23, 1, 17, 19, 27, 11, 23, 25, 12, 13, 4, 5, 19, 27, 14, 19, 31, 39, 10, 13, 6, 7, 22, 23, 14, 15, 0, 5, 31, 39, 53, 1, 47, 49, 18, 21, 59, 3, 57, 1, 6, 17, 49, 57, 39, 43, 69, 9, 47, 51
Offset: 1

Views

Author

Peter Kagey, Feb 18 2017

Keywords

Comments

If a(n) = 0 or a(n) = n, then A282443(n) = n and n is in A282444.
a(n) is bounded above by A282443(n) and bounded below by n - A282443(n).

Examples

			For n = 4:
step size 1: 0 -> 1 -> 2 -> 3 -> 4 (four steps);
step size 2: 4 -> 2 -> 0 (two steps);
step size 3: 0 -> 3 (one step).
Because the walker cannot take four steps down, a(4) = 3 (the final position).

Links

Crossrefs

Cf. A282442, A282443, A282444.
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.