A chain reaction producing primes

Let's transform a sequence of integers into another one, where only prime terms are left.

This is done by expelling a digit from a(n) and sending it towards a(n+1); there, this "bullet" digit will replace (and expel in turn) a digit of a(n+2) towards a(n+3), and so on. After this "chain reaction" is completed, all "hit" terms will be prime.

As usual, we want the sequence S to be the lexicographically earliest one made of distinct integers > 0 with this property. If I'm not wrong (caveat!) S starts like this:

S = 1, 10, 101, 103, 107, 109, 111, 11, 12, 2, 3, 4, 13, 14, 17, 15, 5, 6, 21, 7, 16, 27, 8, 19, 18, ...

Explanation:

In yellow are the successive expelled digits – and we see after S the new sequence P of prime terms only:

S = 1, 10, 101, 103, 107, 109, 111, 11, 12, 2, 3, 4, 13, 14, 17, 15, 5, 6, 21, 7, 16, 27, 8, 19, 18, ...

P = .  11, 101, 103, 107, 109, 101, 11, 11, 2, 2, 3, 43, 11, 47, 11, 5, 5, 61, 2, 17, 67, 2, 89, 11, ...

S is not in the OEIS.


February 23rd update:

A variant with odd terms (instead of primes):
> Let's transform a sequence of distinct integers >0 into another one, where only odd terms are left. 

T = 1,2,11,3,4,13,5,6,15,7,8,17,9,10,101,103,105,107,109,111,12,19,14,21,23,25,27,29,31,16,33,18,35,20,113,22,37,24,39,26,41,43,45,47,49,51,28,53,30,115,32,55,34,57,36,59,38,61,63,65,67,69,71,40,117,42,73,44,75,46,77,48,79,50,119,52,81,83,85,87,89,91,54,93,56,95,58,97,60,121,99,62,...
(the blue digits are the expelled ones).

Coming soon (?) the "only even terms are left".

February 24th update:

A variant with even terms (instead of odd):
> Let's transform a sequence of distinct integers >0 into another one, where only even terms are left. 

U = 1, 10, 12, 14, 16, 18, 20, 3, 22, 2, 4, 5, 24, 6, 7, 26, 8, 9, 28, 11, 30, 32, 34, 36, 38, 40, 13, 42, 15, 44, 17, 46, 19, 48, 21, 50, 52, 54, 56, 58, 60, 23, 62, 25, 64, 27, 66, 29, 68, 31, ...


February 25th update:
A variant with Fibonacci terms (instead of even):
> Let's transform a sequence of distinct integers >=0 into another one, where only Fibonacci terms are left. 

V = 0, 1, 2, 3, 4, 30, 610, 611, 5, 6, 110, 7, 307, 612, 8, 9, 80, 613, 10, 614, 31, 13, 20, 615, 15, 21, 22, 11, 23, 41, 32, 51, 25, 61, 210, 71, 317, 24, 33, 14, 26, 310, 34, 12, 81, 19, ...

February 26th update:
A variant with square terms (instead of Fibonacci):
> Let's transform a sequence of distinct integers >0 into another one, where only square terms are left. 

W = 1, 2, 15, 3, 16, 4, 5, 20, 100, 101, 6, 10, 102, 25, 35, 26, 45, 7, 506, 103, 36, 46, 8, 11, 9, 40, 104, 19, 56, 21, 66, 12, 55, 22, 65, 13, 76, 516, 80, 105, 23, 86, 31, 96, 41, 81, 82, 75, 526, 85, 51, 24, 29, 95, 42, 111, 83, 124, 84, 39, 224, 121, 131, 324, 424, 49, 59, 27, 536, 524, 28, 61, 14, ...

February 27th update:
All those seqs have now been computed (and corrected!) by Carole D. – many thanks Carole!
They are in the OEIS (or will be soon):
Prime numbers left: https://oeis.org/A351996
Odd numbers left: https://oeis.org/A351997
Even numbers left: https://oeis.org/A351998
Fibonacci numbers left: https://oeis.org/A351999
Square numbers left: https://oeis.org/A352000

 










Commentaires

Enregistrer un commentaire

Posts les plus consultés de ce blog

Square my chunks and add

Image
The idea is to transform the integer a into b and iterate. Cut a into the number of chunks you want, square them, add those squares. Example a = 1023 can be transformed in b  (last column) like this: 1 ² + 0 ² + 2 ² + 3 ² = 1 + 0 + 4 + 9  = 14 = b 1 ² + 0 ² + 23 ²     = 1 + 0 + 529    = 530   10 ² + 2 ² + 3 ²     = 100 + 4 + 9    = 113   10 ² + 23 ²         = 100 + 529      = 629   102 ² + 3 ²         = 10404 + 9      = 10413   1023 ²                              = 1046529   Question #1 Starting with 2 and iterating, what is the shortest path ending in 1? Here are 11 steps (left column) – can you do better? 2    –> 2² = 4 4    –> 4² = 16 16   –> 1² + 6² = 1 + 36 = 37 37   –> 37² = 1369...
Lire la suite

Confingame, 3e étape

Image
Sur le dernier plateau-repas de Timothy McVeigh il y avait un litre de crème glacée à la menthe et aux pépites de chocolat. Sur celui de Victor Feguer, une olive unique non dénoyautée – il pensait qu’elle allait germer dans son corps et donner un olivier, « symbole de paix ». John Wayne Gacy fit honneur à son métier (gérant de trois KFC) en commandant des crevettes grillées, du poulet grillé, des frites et des fraises. Ses derniers mots furent Kiss my ass . Sacco et Vanzetti eurent droit à de la soupe, de la viande, des toasts et du thé. Le plateau-repas d’Angel Nieves Diaz resta vide, car il ne voulait rien. On lui apporta le plat réglementaire servi en prison ce jour-là (dinde hachée avec assaisonnement pour tacos, riz, fromage râpé, haricots mouchetés, tortillas, croustillant aux pommes, Ice Tea ), mais il ne toucha à rien*. _____________ * Murderpedia .  Contributeurs à la 3e étape du Confingame : Pascale Angelini-Cordonnier propose une captur...
Lire la suite

Triples for the new year

Image
(Dall-e creation ) The hereunder sequence  S  is both a succession of triples of monotonically increasing numbers and a succession of triples of monotonically increasing digits. S  is the lexicographically earliest such sequence with distinct number-triples: S = 0,1,2,0,1,3,0,1,4,0,1,5,0,1,6,0,1,7,0,1,8,0,1,9,0,2,3,0,2,4,0,2,5,0,2,6,0,2,7,0,2,8,0,2,9,0,3,4,0,3,5,0,3,6,0,3,7,0,3,8,0,3,9,0,4,5,0,4,6,0,4,7,0,4,8,0,4,9,0,5,6,0,5,7,0,5,8,0,5,9,0,6,7,0,6,8,0,6,9,0,7,8,0,7,9,0,8,9,1,2,3,1,2,4,1,2,5,1,2,6,1,2,7,1,2,8,1,2,9,1,3,4,1,3,5,1,3,6,1,3,7,1,3,8,1,3,9,1,4,5,1,4,6,1,4,7,1,4,8,1,4,9,1,5,6,1,5,7,1,5,8,1,5,9,1,6,7,1,6,8,1,6,9,1,7,8,1,7,9,1,8,9,2,3,4,2,3,5,2,3,6,2,3,7,2,3,8,2,3,9,2,4,5,2,4,6,2,4,7,2,4,8,2,4,9,2,5,6,2,5,7,2,5,8,2,5,9,2,6,7,2,6,8,2,6,9,2,7,8,2,7,9,2,8,9,3,4,5,3,4,6,3,4,7,3,4,8,3,4,9,3,5,6,3,5,7,3,5,8,3,5,9,3,6,7,3,6,8,3,6,9,3,7,8,3,7,9,3,8,9,4,5,6,4,5,7,4,5,8,4,5,9,4,6,7,4,6,8,4,6,9,4,7,8,4,7,9,4,8,9,5,6,7,5,6,8,5,6,9,5,7,8,5,7,9,5,8,9,6,7,8,6,7,9,6,8,9,7,...
Lire la suite