[seqfan] Introducing the Sidef programming language

[Trizen]

Dear math lovers,

I'm happy to share with you a free and open-source programming language,
called Sidef, showing how it can be used for computing various OEIS
sequences and doing computational number theory efficiently.


The number theory tutorial that I've written specially for OEIS users, can
be found at:

* https://github.com/trizen/sidef/blob/master/NUMBER_THEORY_TUTORIAL.md
*
https://github.com/trizen/sidef/releases/download/23.08/sidef-number-theory.pdf


The syntax of the language is relatively simple and easy to learn:

say 25.by { .is_prime } # first 25 primes
say 30.of { .esigma } # first 30 values of the e-sigma function
say factor(2**128 + 1) # prime factorization of the 7-th Fermat number


Currently, the implementation has over 1,000 built-in numerical functions,
excelling at integer factorization, primality testing and other
prime-related tasks.

It also includes fast methods for generating k-almost primes, k-omega
primes, Fermat pseudoprimes, Carmichael numbers and Lucas-Carmichael
numbers with k prime factors in a given range.


For the documentation of each numerical function, please see:

* https://metacpan.org/pod/Sidef::Types::Number::Number


Happy computing!

Daniel Suteu