|
|
A100617
|
|
There are n people in a room. The first half (i.e., floor(n/2)) of them leave, then 1/3 (i.e., floor of 1/3) of those remaining leave, then 1/4, then 1/5, etc.; sequence gives number who remain at the end.
|
|
6
|
|
|
1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
REFERENCES
|
V. Brun, Un procédé qui ressemble au crible d'Eratosthene, Analele Stiintifice Univ. "Al. I. Cuza", Iasi, Romania, Sect. Ia Matematica, 1965, vol. 11B, pp. 47-53.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = k for Fl(k) <= n < Fl(k+1), where Fl(i) = A000960(i).
|
|
EXAMPLE
|
7 -> 7 - [7/2] = 7 - 3 = 4 -> 4 - [4/3] = 4 - 1 = 3 -> 3 - [3/4] = 3 - 0 = 3, which is now fixed, so a(7) = 3.
|
|
MAPLE
|
f:=proc(n) local i, j, k; k:=n; for i from 2 to 10000 do j := floor(k/i); if j < 1 then break; fi; k := k-j; od; k; end;
|
|
MATHEMATICA
|
a[n_] := (k = 2; FixedPoint[# - Floor[# / k++]&, n]); Table[a[n], {n, 1, 96}] (* Jean-François Alcover, Nov 15 2011 *)
|
|
PROG
|
(Haskell)
a100617 = f 2 where
f k x = if x' == 0 then x else f (k + 1) (x - x') where x' = div x k
(Scheme, with my IntSeq-library)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|