login

Draft edits for A397806

(Bold, blue-underlined text is an ; faded, red-underlined text is a deletion.)

This sequence contains draft edits but has not been submitted for review.
To submit the changes for review, click the button at the bottom.

allocated for Romain Malécot
(history; published version)
Individual edits:
#3 by Romain Malécot at Fri Jul 10 13:15:17 EDT 2026
NAME

allocated for Romain Malécot

DATA

OFFSET

COMMENTS

LINKS

KEYWORD

allocated

AUTHOR

STATUS

approved

#4 by Romain Malécot at Fri Jul 10 13:19:20 EDT 2026
COMMENTS

We define the Gaston's algorithm as below.

CROSSREFS

#5 by Romain Malécot at Fri Jul 10 13:23:47 EDT 2026
STATUS

editing

Discussion
Fri Jul 10
13:29
Stefano Spezia: Link format is not correct. See Style Sheet for Controbutors: https://oeis.org/wiki/Style_Sheet
13:29
Stefano Spezia: Are you sure for unkn keyword?
15:10
Michel Marcus: the link is not only an URL : read the edit screen
#6 by Michel Marcus at Fri Jul 10 15:10:57 EDT 2026
CROSSREFS
KEYWORD

more,nonn,unkn,changed

STATUS

proposed

#7 by Michel Marcus at Fri Jul 10 15:11:24 EDT 2026
COMMENTS

Let L = [a_1, a_2, , a_n] be a list of size n of real numbers in [0, 1[.

#8 by Michel Marcus at Fri Jul 10 15:11:49 EDT 2026
COMMENTS

Then, every term a_i of L is inserting one by one in the resulting list in position k, such as (k - 1)/i <= a_i < k/i.

#9 by Michel Marcus at Fri Jul 10 15:12:00 EDT 2026
STATUS

editing

#10 by Michel Marcus at Fri Jul 10 17:03:02 EDT 2026
LINKS

https://tfjm.org/wp-content/uploads/2026/01/index.pdf

STATUS

proposed

Discussion
Fri Jul 10
17:03
Michel Marcus: like this
#11 by Michel Marcus at Fri Jul 10 17:03:14 EDT 2026
STATUS

editing

Discussion
Fri Jul 10
17:05
Sean A. Irvine: Please remove non-ASCII "²"
#12 by Sean A. Irvine at Fri Jul 10 17:05:12 EDT 2026
STATUS

proposed

#13 by Romain Malécot at Sat Jul 11 02:49:23 EDT 2026
LINKS

TFJM2, <a href="https://tfjm.org/wp-content/uploads/2026/01/index.pdf">Problèmes du 16ème Tournoi Français des Jeunes Mathématiciennes et Mathématiciens</a>, Jan 08 2026.

Discussion
Sat Jul 11
02:55
Romain Malécot: I think the "²" should not be removed since it is part of the name of the tournament which is written that way, not with "2" or "^2".
02:57
Romain Malécot: I had added the unkn keyword because almost nothing is known about this sequence (except the first terms).
#14 by Romain Malécot at Tue Jul 14 10:21:35 EDT 2026
STATUS

editing

Discussion
Tue Jul 14
10:44
Michel Marcus: If we don't accept things like TFJM², then we are in a dead end ....
10:45
Michel Marcus: eight should be eighth ?
#15 by Romain Malécot at Tue Jul 14 11:55:03 EDT 2026
COMMENTS

Gaston's algorithm was introduced in the eight problem of the 2026 edition of the TFJM² (French Tournament of Young Mathematicians) (see links).

STATUS

proposed

Discussion
Tue Jul 14
11:55
Romain Malécot: Yes.
#16 by Romain Malécot at Tue Jul 14 11:55:19 EDT 2026
STATUS

editing

#17 by Sean A. Irvine at Tue Jul 14 15:41:15 EDT 2026
COMMENTS

Gaston's algorithm was introduced in the eighth problem of the 2026 edition of the TFJM² (French Tournament of Young Mathematicians) (see links).

STATUS

proposed

#18 by Sean A. Irvine at Tue Jul 14 15:41:19 EDT 2026
STATUS

editing

#19 by Sean A. Irvine at Tue Jul 14 15:43:29 EDT 2026
LINKS

TFJM², <a href="https://tfjm.org/wp-content/uploads/2026/01/index.pdf">Problèmes du 16ème Tournoi Français des Jeunes Mathématiciennes et Mathématiciens</a>, version 2, Jan 08 2026, p. 10.

STATUS

proposed

Discussion
Tue Jul 14
15:43
Sean A. Irvine: We definitely do not want "²"
#20 by Sean A. Irvine at Tue Jul 14 15:43:48 EDT 2026
STATUS

editing

Discussion
Tue Jul 14
15:44
Sean A. Irvine: I also do not like "[0, 1["
16:34
Michel Marcus: This is the french way  0 <= x < 1  (closed, open)
Wed Jul 15
12:53
Hugo Pfoertner: How can we verify that the given terms are correct? Is the tournament finished or still ongoing? If the tournament is not yet over, no results should be published in OEIS. If it is finished, however, the question is: Is there a published solution, or can the solution method be described here in such a way that OEIS users can understand it? Is there a program for the part of the problem described here (question 8 of problem 8, "Tri trop rapide")?
#21 by Hugo Pfoertner at Wed Jul 15 12:53:05 EDT 2026
STATUS

proposed

Discussion
Wed Jul 22
18:50
OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A397806 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server
All edits since published version (omitting small deletions for readability):
NAME

allocated for Romain Malécot

DATA

OFFSET

COMMENTS

LINKS

CROSSREFS

KEYWORD

allocated

AUTHOR

STATUS

approved

Discussion
Fri Jul 10
13:29
Stefano Spezia: Link format is not correct. See Style Sheet for Controbutors: https://oeis.org/wiki/Style_Sheet
13:29
Stefano Spezia: Are you sure for unkn keyword?
15:10
Michel Marcus: the link is not only an URL : read the edit screen
17:03
Michel Marcus: like this
17:05
Sean A. Irvine: Please remove non-ASCII "²"
Sat Jul 11
02:55
Romain Malécot: I think the "²" should not be removed since it is part of the name of the tournament which is written that way, not with "2" or "^2".
02:57
Romain Malécot: I had added the unkn keyword because almost nothing is known about this sequence (except the first terms).
Tue Jul 14
10:44
Michel Marcus: If we don't accept things like TFJM², then we are in a dead end ....
10:45
Michel Marcus: eight should be eighth ?
11:55
Romain Malécot: Yes.
15:43
Sean A. Irvine: We definitely do not want "²"
15:44
Sean A. Irvine: I also do not like "[0, 1["
16:34
Michel Marcus: This is the french way  0 <= x < 1  (closed, open)
Wed Jul 15
12:53
Hugo Pfoertner: How can we verify that the given terms are correct? Is the tournament finished or still ongoing? If the tournament is not yet over, no results should be published in OEIS. If it is finished, however, the question is: Is there a published solution, or can the solution method be described here in such a way that OEIS users can understand it? Is there a program for the part of the problem described here (question 8 of problem 8, "Tri trop rapide")?
Wed Jul 22
18:50
OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A397806 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server
Log in to edit this sequence.