[seqfan] Re: UnitaryPhi

[zbi74583_boat at yahoo.co.jp]

    Hi  Michel
    Thanks for computing these term
    Which may not be the least?

    In Last mail, I asked to post b(n) to OEIS, but wait a little
    >If n=2*k then b(n)=a(k)  If n=2*k+1 and GCD(a(n),a(n-1))=1 then b(n)=a(n)*a(n-1)     I think the second theorem needs proof, so after I will have sent it to you, post to OEIS



    Yasutoshi
    

----- Original Message -----
> From: "michel.marcus at free.fr" <michel.marcus at free.fr>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Cc: 
> Date: 2018/9/12, Wed 13:49
> Subject: [seqfan] Re: UnitaryPhi
> 
> 
> 
> Some progress for A318842: 
> 
> 
> 2, 3, 4, 5, 144, 7, 8, 9, 400, 11, 64281600, 13, 84672, 129600, 16, 17, 518400, 
> 19, 4327213363200, 254016, 6326996189184000000, 23, 300174920860041216000, 25, 
> 2747437056, 27, 3136, 29, 0, 31, 32, 1205601408000, 76691908360272818995200000, 
> 2274751639591200000, 5184, 37, 0, 2704508352, 36396026233459200000, 41, 
> 175326518051093348352000000, 43, 0, 9963648000, 11667048448, 47, 0, 49, 
> 35043840000 
> 
> 
> where the larger terms may not be the least values. 
> 
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>