[seqfan] Re: Two make a palindrome

[Neil Sloane]

Concerning the binary version, to get the ball rolling I added A230891 and
A230892.
They need more terms, a b-file, some theorems, ...


On Sun, Nov 10, 2013 at 9:12 AM, Neil Sloane <njasloane at gmail.com> wrote:

> Maximilian said:
> "I propose the sequence as https://oeis.org/draft/A228407 where I added a
> link to Rob's post/calculations, and also a list of "records of
> minima", i.e., (n,a(n)) where the least missing integers occur. Maybe
> these could become sequences on their own (the values and the indices separately)
> if further investigations in that sense are to be made."
> Yes, that would be a very good idea - could you possibly add those two
> sequences?
> So here - like Recaman's A005132 - we have a sequence that may or may not
> contain every number!
> Thanks!  Neil
>
>
> On Sat, Nov 9, 2013 at 7:54 PM, Maximilian Hasler <
> maximilian.hasler at gmail.com> wrote:
>
>> Rob, Eric, SeqFans,
>> I propose the sequence as https://oeis.org/draft/A228407 where I added
>> a link to Rob's post/calculations, and also a list of "records of
>> minima", i.e., (n,a(n)) where the least missing integers occur. Maybe
>> these could become sequences on their own (the values and the indices
>> separately) if further investigations in that sense are to be made.
>> Regards,
>> Maximilian
>>
>> > Le 9 nov. 2013 à 17:10, "Rob Arthan" <rda at lemma-one.com> a écrit :
>> >
>> >> Eric,
>> >>
>> >> That's a fun sequence and an interesting conjecture. As you say, it is
>> not easy to calculate by hand. To get a feel
>> >> for the conjecture I wrote an ML program to do it. This is what I got
>> for the first 200 values:
>> (...)
>> >> My program is now in a loop printing out n, a(n) and m(n). The
>> evidence currently supports your conjecture but m(n) is
>> >> growing quite slowly:
>> >>
>> >>   a(5846) = 589, m(5846) = 598
>> >>   a(5847) = 598, m(5846) = 679
>> >>   ...
>> >>   a(11539) = 1617, m(11539) = 679
>> >>   a(11540) =  679 m(11540) = 697
>> >>
>> >> So 697 persisted as the smallest missing integer for more than 5,000
>> stages. I will leave it running and report back if anything noteworthy
>> occurs.
>> >>
>> >> Regards,
>> >>
>> >> Rob.
>> >>
>>
>> _______________________________________________
>>
>> Seqfan Mailing list - http://list.seqfan.eu/
>>
>
>
>
> --
> Dear Friends, I have now retired from AT&T. New coordinates:
>
> Neil J. A. Sloane, President, OEIS Foundation
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>


-- 
Dear Friends, I have now retired from AT&T. New coordinates:

Neil J. A. Sloane, President, OEIS Foundation
11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
Phone: 732 828 6098; home page: http://NeilSloane.com
Email: njasloane at gmail.com