A096274: checking/more terms

[zak seidov]

Martin,
thanks for a(21)-a(26)!!

You may send these to Neil,
if you don't mind with correct formatting.

Thanks,
Zak

--- Martin Fuller <martin_n_fuller at btinternet.com>
wrote:

> I get the same a(19) and a(20) as Peter, and more
> terms to a(26). 
> Roughly the same code as Peter, run for longer.
> 
> %I A096274
> %S A096274 2, 8, 13, 20, 25, 595, 1044, 7932, 74247,
> 14693476,
> 16766626, 24072338, 72643740, 1881945888,
> 3304284638, 5163731431,
> 5669949197, 16209038688, 23714508403, 56796564073,
> 181057353263,
> 323874989643, 406930606305, 539293061152,
> 1751203649485, 2136659012156
> 
> Also three more terms for two related sequences:
> %I A122278
> %S A122278 5, 7, 11, 12, 13, 19, 20, 21, 25, 27, 28,
> 29
> 
> %I A122279
> %S A122279 1, 114, 472, 86520, 397603, 514911,
> 5123504, 382611481,
> 1166422075, 24846586495, 62401902289, 344065155571
> 
> If anyone is interested, these long ascending
> sequences appear in
> A096535 ending at indices 7, 472, 1925, 346314,
> 1590715, 2059899,
> 20493382, 1530447664, 4665659086, 99386570569,
> 249607661250,
> 1376261443750.
> 
> Martin Fuller
> 
> --- Peter Pein <petsie at dordos.net> wrote:
> 
> > zak seidov schrieb:
> > > A096274: checking/more terms
> > > 
> > > Neil, Bob, Jim, seqfans,
> > > 
> > > I've checked (and re-checked) terms in A096274
> and
> > > found them OK:
> > > 
> > > %S A096274
> > >
> >
>
2,8,13,20,25,595,1044,7932,74247,14693476,16766626,24072338,72643740,
> > > 1881945888,3304284638,5163731431. 
> > > 
> > > Also, I'd found three more terms:
> > > 5669949197, 16209038688, 23714508404.
> > > 
> > > Some C++/PARI gurus
> > > may wish to check the last three terms 
> > > (and find more).
> > > Thanks, Zak 
> > > 
> > 
> > Hi Zak,
> > 
> > with a little C-program (see below) I get almost
> the same values. The
> > only difference is a(19)=23714508403 instead of
> 23714508404.
> > Additionally my computer assumes a(20) to be
> 56796564073.
> > 
> > Peter
> > 
> > the program:
> > 
> > #include <stdio.h>
> > 
> > main(int argc, char *argv[])
> > {
> > long long a0=1, a1=1, n=1, tmp, nmax;
> > 
> >   if (argc != 2) {
> >     fprintf(stderr,"%s n\ncalculates the indices
> of the first n
> > zeroes
> > in
>
http://www.research.att.com/~njas/sequences/A096535\n",argv[0]);
> >     return(1);
> >   }
> >   nmax=atol(argv[1]);
> >   while (nmax-- > 0) {
> >     while(a1 != 0) {
> >       tmp = (a0 + a1) % ++n; a0 = a1; a1 = tmp;
> >     }
> >     printf("%lld\n",n++); a1 = a0; a0 = 0;
> >   }
> >   return 0;
> > }
> > 
> > the output:
> > 
> > petsie at leierkasten:~$ time ./a096274 20
> > ...
> > no differences here
> > ...
> > 23714508403
> > 56796564073
> > 
> > real    51m43.296s
> > user    33m16.801s
> > sys     0m0.744s
> > 
> 
> 



      ____________________________________________________________________________________
Never miss a thing.  Make Yahoo your home page. 
http://www.yahoo.com/r/hs