|
Search: id:A134170
|
|
|
| A134170 |
|
a(n)=the smallest natural number which, expressed in the form d*q+r for all d ranging from 1 to n, q>=r. In other words, when a(n) is divided by the numbers from 1 to n, the remainder is never more than the quotient. |
|
+0
1
|
|
| 1, 2, 3, 4, 10, 12, 21, 24, 36, 40, 60, 60, 84, 84, 112, 112, 144, 144, 180, 180
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
If a prospective term is at least d(d-1) for a certain value of d, all d less than or equal to that value are certain to be satisfied. For k>5, it seems a(2k-1)=a(2k)=2k(k-1).
|
|
EXAMPLE
|
a(7)=21 because division by d=1 to 7 gives 21 r0, 10 r1, 7 r0, 5 r1, 4 r1, 3 r3 and 3 r0, respectively.
|
|
CROSSREFS
|
Sequence in context: A051627 A023725 A076079 this_sequence A049548 A005456 A100773
Adjacent sequences: A134167 A134168 A134169 this_sequence A134171 A134172 A134173
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Bryce Herdt (mathidentity(AT)yahoo.com), Jan 12 2008
|
|
|
Search completed in 0.002 seconds
|
