This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A280522 The number of restarts for the routine described by A280521. 1
 0, 0, 1, 0, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 2, 1, 2, 2, 1, 0, 1, 1, 2, 1, 2, 2, 1, 2, 2, 3, 2, 1, 0, 1, 1, 2, 1, 2, 2, 1, 2, 2, 3, 2, 1, 2, 2, 3, 2, 3, 3, 2, 1, 0, 1, 1, 2, 1, 2, 2, 1, 2, 2, 3, 2, 1, 2, 2, 3, 2, 3, 3, 2, 1, 2, 2, 3, 2, 3, 3, 2, 3, 3, 4, 3, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,10 COMMENTS This is simply one less than the number of stages, but is seems like an equally good measure, so it gets its own entry. - N. J. A. Sloane, Jan 27 2017 LINKS Peter Kagey, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A280521(n) - 1. CROSSREFS Cf. A280521, A280523. Sequence in context: A255482 A204172 A126304 * A324796 A049455 A322975 Adjacent sequences:  A280519 A280520 A280521 * A280523 A280524 A280525 KEYWORD nonn AUTHOR Peter Kagey, Jan 04 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 December 13 03:41 EST 2019. Contains 329968 sequences. (Running on oeis4.)