A051503 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A051503

a(n) = min { n, floor(100/n) }.

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..93.

MAPLE

Digits := 40; [seq(floor(min(n, 100/n)), n=1..100)];

MATHEMATICA

Table[Min[n, Floor[100/n]], {n, 100}] (* Harvey P. Dale, Jan 09 2021 *)

CROSSREFS

Sequence in context: A355675 A073835 A334387 * A331375 A179622 A367617

Adjacent sequences: A051500 A051501 A051502 * A051504 A051505 A051506

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

STATUS

approved