11 diamonds
We have built hereunder a succession of 11 such diamonds where A is (D + B) and C is |D - B|.
All successive integers in the middle string are distinct and no digit is duplicated in a diamond.
Can you produce a set of 12 or more such diamonds?
_____________
Same day update
Giorgos Kalogeropoulos was quick to beat my 11 diamonds with the hereunder red string of... 29 integers!
GK
(a few minutes later)
> Here is the complete graph of the sequence:
> A marvelous work – thank you Giorgos!
(will submit this soon to the OEIS)
______________________________
Thursday 8, Feb 2024 update
Michael S. Branicky found 38 terms! And this seems impossible to beat:
S = 56, 47, 9, 41, 39, 86, 57, 49, 37, 61, 24, 6, 1, 3, 4, 5, 2, 7, 16, 54, 36, 45, 18, 52, 38, 67, 13, 62, 8, 17, 23, 68, 27, 19, 26, 83, 79, 84.
Many thanks to him, Giorgos Kalogeropoulos and Kevin Ryde. This is now here in the OEIS.
Commentaires
Enregistrer un commentaire