World!OfNumbers |
WON plate 46 | |
||
---|---|---|---|

[ In a attempt to find the largest possible 'free of palindromic substrings' - or just
3 - 32 digits^{67} = 92709463147897837085761925410587355 - 39 digits^{15} = 179236021709762370418314530975341796875(You've other record numbers of this kind ! Please submit them to me and I'll display them here also.) Carlos B. Rivera F. sent a method to produce infinite large 'free of palindromic substrings' numbers. First he gives two examples To produce the palfree number 123123123123 To produce the palfree number 1234123412341234 and then he provides the To produce N-N-N-N
Is this the beginning or the end of the palfree numbers story ?
So many years later I resumed the topic and searched for Here is the largest Fibonacci numbers I could come up with Fibonacci(61) = The search went all the way up to Fibonacci(1200) so it looks The provisionally complete sequence is :
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 15, 16, 17, 18, 21, 23, 25, 27, Strings of zero's are not allowed, otherwise 109 and 130 The sequence (n)! starts like this : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ... Alas from factorial 10 (3628800) onwards you see a string
So from here on we will search for palfree factorials with
But then I went all the way up to factorial 100 and gave up. 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 12 | |||

A000046 Prime Curios! Prime Puzzle Wikipedia 46 Le Nombre 46 Numberland 46 |

[ TOP OF PAGE]