A397807 - OEIS

Draft edits for A397807

(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.

A397807

allocated for Romain Malécot
(history; published version)

Individual edits:

#2 by Romain Malécot at Fri Jul 10 13:19:25 EDT 2026

NAME

allocated for Romain Malécot

DATA

OFFSET

COMMENTS

LINKS

CROSSREFS

KEYWORD

allocated

AUTHOR

STATUS

approved

#3 by Romain Malécot at Fri Jul 10 13:23:45 EDT 2026

STATUS

editing

Discussion

Fri Jul 10

15:09

Robert C. Lyons: Link format not correct.

#4 by Michel Marcus at Fri Jul 10 15:12: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.

CROSSREFS

A397806

KEYWORD

more,nonn,unkn,changed

STATUS

proposed

#5 by Michel Marcus at Fri Jul 10 15:13:44 EDT 2026

COMMENTS

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

The n-th Gaston's second-class number a(n) is the number of iterations of the Gaston's algorithm required for every n-sized list is either sorted or never becomes sorted.

Discussion

Fri Jul 10

15:14

Michel Marcus: please make a correct link

#6 by Michel Marcus at Fri Jul 10 15:14:09 EDT 2026

STATUS

editing

Discussion

Fri Jul 10

17:05

Sean A. Irvine: Same problem

#7 by Sean A. Irvine at Fri Jul 10 17:05:37 EDT 2026

STATUS

proposed

#8 by Romain Malécot at Sat Jul 11 02:45:00 EDT 2026

LINKS

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

Discussion

Sat Jul 11

02:57

Romain Malécot: Why has the unkn keyword been removed? I had added it because almost nothing is known about this sequence (except the first terms).

#9 by Romain Malécot at Tue Jul 14 10:21:24 EDT 2026

STATUS

editing

#10 by Romain Malécot at Tue Jul 14 11:55:46 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

#11 by Romain Malécot at Tue Jul 14 11:55:54 EDT 2026

STATUS

editing

#12 by Sean A. Irvine at Tue Jul 14 15:41:37 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

Discussion

Tue Jul 14

15:42

Sean A. Irvine: Did you read the definition of the "unkn" keyword? It was correctly removed.

#13 by Sean A. Irvine at Tue Jul 14 15:42:14 EDT 2026

STATUS

editing

#14 by Sean A. Irvine at Tue Jul 14 15:42:58 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

#15 by Sean A. Irvine at Tue Jul 14 15:43:02 EDT 2026

STATUS

editing

Discussion

Wed Jul 15

13:24

Hugo Pfoertner: I have the same questions here that I also asked in the discussion about A397806.

#16 by Hugo Pfoertner at Wed Jul 15 13:24:20 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/A397807 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