[seqfan] Re: Java implementations update

[Alonso Del Arte]

Well, you might like Scala. You can name your addition function "+()"
instead of "add()", and you can use infix notation, e.g., "a + b" or "a add
b". You can run a few lines in Scastie online to get the %S, %T, %U lines,
without needing to write a main(), or you could create a whole package on
your system with the JVM that lets you pass as a function as an argument
and then it generates a B-file to say, *n* = 10000.

Al

On Wed, Jun 19, 2019 at 12:06 AM Sean A. Irvine <sairvin at gmail.com> wrote:

> Yes, most of the programs have to resort to function calls for "add",
> "multiply", etc..  Java is well-known for being verbose in this regard.
>
> But then again I find most of the Mathematica and Haskell programs in the
> OEIS incomprehensible.  Tastes vary I guess.
>
> Sean.
>
> On Wed, 19 Jun 2019 at 13:11, Fred Lunnon <fred.lunnon at gmail.com> wrote:
>
> > << Georg and I are looking for additional contributors of Java code or of
> > other algorithms which cover some number of sequences. >>
> >   I am unable to parse this --- are you soliciting only Java programs, or
> > in
> > other languages as well; and if the latter, which others are acceptable?
> >
> >   Presumably Java programs (for unbounded sequences at least) must
> > abandon arithmetic expressions in favour of explicit  BigInteger
> function
> > calls, considerably reducing their legiblility?
> >
> >   [ I have to confess to abandoning Java in disgust after the distributor
> > casually disabled the only feature for which I would countenance
> > overlooking its appallingly obsolete syntax and permanently broken
> > concurrent process model, which was its precious ability to run an
> > interactive applet at a remote site without hindrance while browsing.
> >
> >   Never forget how easily in the online world a stroke of a keyboard
> > in some big tech office can obliterate many years work by a multitude
> > of individuals, without recourse to compensation! ]
> >
> > WFL
> >
> >
> >
> > On 6/18/19, Sean A. Irvine <sairvin at gmail.com> wrote:
> > > Thanks to recent contributions by Georg Fischer, the collection of Java
> > > programs for OEIS sequences (jOEIS) now has implementations for over
> > 58200
> > > sequences, especially concentrated in A-numbers less than A024000.  We
> > are
> > > currently covering about 1/6 of all sequences.
> > >
> > > The main aim of the project is to validate sequence data in the OEIS.
> > >
> > > The entire project is available on github:
> > >
> > > https://github.com/archmageirvine/joeis
> > >
> > > To the extent possible, these implementations are regularly tested
> > against
> > > the data lines in the corresponding sequences.  Georg has done
> extensive
> > > testing against b-files, leading to numerous corrections in the OEIS
> (and
> > > to be fair, in the implementations as well).
> > >
> > > Georg and I are looking for additional contributors of Java code or of
> > > other algorithms which cover some number of sequences.  The following
> > link
> > > is those A-numbers below A024000 for which we do not currently have an
> > > implementation:
> > >
> > >
> >
> https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/notdone.dat
> > >
> > > Some of these are inherently hard, but in many cases it is lack of
> > > information that prevents implementation.  Many currently have no
> useful
> > > program (or formula) in any language and are thus good candidates for
> > > general improvement in the OEIS.
> > >
> > > Sean.
> > >
> > > --
> > > Seqfan Mailing list - http://list.seqfan.eu/
> > >
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>


-- 
Alonso del Arte
Author at SmashWords.com
<https://www.smashwords.com/profile/view/AlonsoDelarte>
Musician at ReverbNation.com <http://www.reverbnation.com/alonsodelarte>