|
Search: id:A139076
|
|
|
| A139076 |
|
Let M(n) = maximal value of (n/k)^k over all k = 1, 2, ...; a(n) = floor(M(n)). |
|
+0
5
|
|
| 1, 2, 3, 4, 6, 9, 12, 18, 27, 39, 57, 81, 118, 172, 244, 359, 517, 743, 1085, 1554, 2254, 3270, 4667, 6818, 9846, 14116, 20589, 29619, 42762, 62088, 89055, 129307, 187064, 267893, 390499, 563208, 811020, 1178088, 1694774, 2452059, 3551313, 5097655, 7405861, 10698505
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
The sequence of M(n)'s begins 1, 2, 3, 4, 6.2500000000000000000, 9, 12.703703703703703703..., 18.962962962962962963..., 27, 39.062500000000000000, 57.191406250000000000, 81, 118.81376000000000000, 172.10368000000000000, 244.14062500000000000, ...
|
|
MAPLE
|
Digits:=20; g:=(n, k)->evalf( (n/k)^k );
# for M(n):
f:=proc(n) local i, a; global g; a:=1; for i from 1 to 2*n do if g(n, i) > a then a:=g(n, i); fi; od: a; end;
# for A139076:
f1:=proc(n) local i, a; global g; a:=1; for i from 1 to 2*n do if g(n, i) > a then a:=g(n, i); fi; od: floor(a); end;
# for A139077:
f2:=proc(n) local i, a; global g; a:=1; for i from 1 to 2*n do if g(n, i) > a then a:=g(n, i); fi; od: round(a); end;
# for A139078:
f3:=proc(n) local i, a; global g; a:=1; for i from 1 to 2*n do if g(n, i) > a then a:=g(n, i); fi; od: ceil(a); end;
|
|
CROSSREFS
|
Suggested by A000792. Cf. A139050, A139051, A139077, A139078.
Adjacent sequences: A139073 A139074 A139075 this_sequence A139077 A139078 A139079
Sequence in context: A018287 A017823 A017982 this_sequence A126011 A018256 A111791
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Jun 03 2008
|
|
|
Search completed in 0.002 seconds
|
