This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Peter Kagey, Table of n, a(n) for n = 1..10000 EXAMPLE 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. CROSSREFS Cf. A282442, A282443. Sequence in context: A257508 A221975 A137294 * A177959 A108855 A108579 Adjacent sequences:  A282570 A282571 A282572 * A282574 A282575 A282576 KEYWORD nonn AUTHOR Peter Kagey, Feb 18 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 18 07:38 EST 2019. Contains 319269 sequences. (Running on oeis4.)