Digits and more (drafts, new ideas)

 
Here are two seqs that wait for approval in the OEIS; the first one is A374530
The second one is A374504
A few days before, this kind-of-self-describing seq A374405 was published:
> The nonnegative terms followed by their first position in the concatenation of all terms of the sequence.
0, 1, 1, 2, 2, 4, 3, 7, 4, 6, 5, 11, 6, 10, 7, 8, 8, 18, 9, 22, 10, 15, 11, 2, 12, 3, 13, 35, 14, 39, 15, 27, 16, 13, 17, 51, 18, 20, 19, 59, 20, 57, 21, 24, 22, 4, 23, 33, 24, 5, 25, 81, 26, 85, 27, 45, 28, 93, 29, 97, 30, 101, 31, 34, 32, 77, 33, 36, 34, 108, ...

A computation by Michael S. Branicky led to those nice graphs:
A373722 was fun to submit and discuss:
But enough for the past. Here is our latest idea (nothing really new, though):
NAME
The absolute difference D between the two terms framing a comma is a multiple of the absolute difference d of the two digits framing the same comma.
DATA (corrected by GK) 
1, 2, 3, 4, 5, 6, 7, 8, 9, 17, 11, 20, 10, 12, 13, 15, 19, 26, 16, 24, 18, 33, 21, 22, 14, ...
EXAMPLE
____________________
July 16th update
Giorgos Kalogeropoulos just sent me this:
>Hi Eric,
>I finally found some time to write a program about one of your new sequences.
>For your last sequence with differences D and d, I get these 100 terms:
1,2,3,4,5,6,7,8,9,17,11,20,10,12,13,15,19,26,16,24,18,33,21,22,14,28,38,42,30,36,39,25,31,23,27,35,29,44,32,34,37,40,48,51,45,41,47,53,43,46,50,55,49,57,59,62,56,52,58,60,66,54,64,68,70,77,61,73,67,63,69,71,85,65,75,79,80,88,72,84,78,74,82,96,76,86,92,99,81,97,83,95,89,87,91,200,100,101,93,103
Here is the plot of the first 1000 terms

And the first 2000 terms
Merci beaucoup, Giorgos! Nice graphs indeed!
François Schuiten en vente chez Drouot












Commentaires

Enregistrer un commentaire

Posts les plus consultés de ce blog

A square for three (chess)

Image
(English translation after the French text) Voici cinq problèmes d’échecs disjoints : a ) combien faut-il de coups au minimum pour que trois pions soient capturés sur la même case ? b ) trois tours c ) trois cavaliers d ) trois fous e ) trois dames Here are five disjointed chess problems: a) how many moves are required at least for three pawns to be captured on the same square? b) three rooks c) three knights d) three bishops e) three queens Solutions a ) (corrigé grâce à Orion , ici ) 3,5 coups pour 3 pions capturés en b5 (4 moves for White and 3 moves for Black   — 3 pawns  captured on b5)  b ) 5  coups pour 3 tours capturées en a3 (ci-dessous – merci aussi à Orion !-) (5 moves for White and 5 moves for Black  — 3 rooks  captured on a3  hereunder )  c ) 5  coups pour 3 cavaliers capturés en d5  ( ci-dessous) (5 moves for White and 5 moves for Black   — 3 knights  captured on d5  hereunder )  (merci Orion !-) d ) 7  coups pour 3 fous capturés en h6  ( ci-dessous) (7 moves for Whit
Lire la suite

Le tripalin se présente

Image
Un tripalin est constitué de trois images. Chaque image illustre un substantif. Accolés, ces trois substantifs forment une chaîne palindromique. Laquelle nous vous invitons à trouver.  Exemple ci-dessous. Le premier mot est COL-BLEU Le second DUEL Le troisième BLOC . Ces mots forment la chaîne COLBLEUDUELBLOC qui est bien palindromique. Je posterai chaque jeudi une nouvelle salve de tripalins . Rien que des noms illustrés – pas d’adjectifs, pas de verbes conjugués, pas d’adverbes (parfois un prénom ou un nom propre – mais seulement quand il faut). À la demande générale (de mon neveu), chaque tripalin sera surmonté de son numéro d ’ ordre ( octothorpe noir) et de trois nombres bleus. Ces nombres reprennent les trois longueurs (en lettres) des trois mots présents dans le tripalin. On a par exemple ci-dessous [ #0 ↓ 7+4+4 ] car COL-BLEU comporte  7  lettres, DUEL   4  et BLOC   4 . Le numéro d ’ ordre est zéro. #0 ↓ 7+4+4 Voilà – tous retours critiques, construits ou déconstruits, bien
Lire la suite

Underline, reproduce

Image
Dall.e creation If we underline the... « first, second, third, fourth, fifth, sixth, seventh, eighth, ninth, tenth, eleventh,… » letter of this sentence S 1 , we see that the successive underlined letters simply reproduce S 1 . No big deal. If we decide not to start S 1   with "first" but with "sixth", we can reproduce the new S 6  quite easily: S 6 = sixth , second, third, fourth, fifth, first , seventh, eighth, ninth, tenth, eleventh,… S 6  was reproduced in a slightly less mechanical manner than  S 1 :  just two words of  S 1   swapped here ("first" and "sixth", in red, above). If we start S 8  with "eighth" we just swap again a pair of words of S 1  ("first" and "eighth", in red, hereunder): S 8  = eighth , second, third, fourth, fifth, sixth, seventh, first , ninth, tenth, eleventh,… What about starting S 9  with "ninth"? How many swaps do we need to reproduce S 9 ?  This is more tricky! (Indeed, we
Lire la suite