Riordan numbers: Difference between revisions

{{works with|ALGOL 68G|Any - tested with release 2.8.3.win32 and 3.0.3}}

Uses ALGOL 68G's LONG LONG INT which has programmer-specifiable precision. ALGOL 68G version 3 issues a warning that precision 5000 will impact performance but it still executes this program somewhat faster than version 2 does.

# returns a table of the Riordan numbers 0 .. n #

OP RIORDAN = ( INT n )[]LONG INT:

OD

END

{{out}}

<pre>

 

=={{header|F_Sharp|F#}}==

// Riordan numbers. Nigel Galloway: August 19th., 2022

let r()=seq{yield 1I; yield 0I; yield! Seq.unfold(fun(n,n1,n2)->let r=(n-1I)*(2I*n1+3I*n2)/(n+1I) in Some(r,(n+1I,r,n1)))(2I,0I,1I)}

let n=r()|>Seq.take 10000|>Array.ofSeq in n|>Array.take 32|>Seq.iter(printf "%A "); printfn "\nr[999] has %d digits\nr[9999] has %d digits" ((string n.[999]).Length) ((string n.[9999]).Length)

{{out}}

<pre>

 

=={{header|J}}==

472

#":(1e4-1){riordanext^:(1e4) x:1 0

=={{header|PL/I}}==

 

%replace maxRiordan by 32;

end;

 

{{out}}

<pre>

PL/M only handles 8 and 16 bit unsigned integers but also provides two-digit BCD addition/subtraction with carry.

<br>This sample uses the BCD facility to implement 16-digit arithmetic and solve the basic task. [[Ethiopian multiplication]] and [[Egyptian division]] are used, hence the length of the sample.

 

DECLARE FALSE LITERALLY '0';

END;

 

{{out}}

<pre>

 

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #7060A8;">requires</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"1.0.2"</span><span style="color: #0000FF;">)</span> <span style="color: #000080;font-style:italic;">-- mpz_get_str(comma_fill) was not working [!!!]</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"The %6s: %s\n"</span><span style="color: #0000FF;">,</span> <span style="color: #0000FF;">{</span><span style="color: #7060A8;">ordinal</span><span style="color: #0000FF;">(</span><span style="color: #000000;">i</span><span style="color: #0000FF;">),</span> <span style="color: #7060A8;">mpz_get_short_str</span><span style="color: #0000FF;">(</span><span style="color: #000000;">a</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">])})</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre>

 

=={{header|Python}}==

a = [1, 0, 1]

for n in range(3, N):

 

=={{header|Raku}}==

 

my @riordan = 1, 0, { state $n = 1; (++$n - 1) / ($n + 1) × (3 × $^a + 2 × $^b) } … *;

sub abr ($_) { .chars < 41 ?? $_ !! .substr(0,20) ~ '..' ~ .substr(*-20) ~ " ({.chars} digits)" }

 

{{out}}

<pre>First thirty-two Riordan numbers:

{{libheader|Wren-gmp}}

{{libheader|Wren-fmt}}

import "./fmt" for Fmt

 

for (i in [1e3, 1e4]) {

Fmt.print("$,8r: $20a ($,d digits)", i, a[i-1], a[i-1].toString.count)

 

{{out}}