|
|
A338720
|
|
Define b(1)=1 and for n>1, b(n)=n/b(n-1); then a(n) = nearest integer to b(n).
|
|
3
|
|
|
1, 2, 2, 3, 2, 3, 2, 4, 2, 4, 3, 4, 3, 5, 3, 5, 3, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 7, 4, 7, 4, 7, 5, 7, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 9, 5, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 7, 10, 7, 11, 7, 11, 7, 11, 7, 11, 7, 11, 7, 11, 7, 11, 7, 12, 7, 12, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Since b(3) = 3/2, a(3) could also be taken to be 1.
|
|
LINKS
|
|
|
EXAMPLE
|
The first few fractions b(n) are 1, 2, 3/2, 8/3, 15/8, 16/5, 35/16, 128/35, 315/128, 256/63, 693/256, 1024/231, 3003/1024, 2048/429, ...
|
|
MAPLE
|
A338720b := proc(n)
option remember ;
if n = 1 then
1;
else
n/procname(n-1) ;
end if;
end proc:
round(A338720b(n)) ;
end proc:
|
|
MATHEMATICA
|
b[n_] := b[n] = If[n == 1, 1, n/b[n-1]];
a[n_] := Round[b[n]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|