June 2018 Update
This commit is contained in:
parent
ba8067c3b7
commit
22f33d4004
5278 changed files with 84726 additions and 14379 deletions
|
|
@ -1,9 +1,11 @@
|
|||
my @ffr;
|
||||
my @ffs;
|
||||
my %r = 1 => 1;
|
||||
my %s = 1 => 2;
|
||||
|
||||
@ffr.plan: 0, 1, gather take @ffr[$_] + @ffs[$_] for 1..*;
|
||||
@ffs.plan: 0, 2, 4..6, gather take @ffr[$_] ^..^ @ffr[$_+1] for 3..*;
|
||||
sub ffr ($n) { %r{$n} //= ffr($n - 1) + ffs($n - 1) }
|
||||
sub ffs ($n) { %s{$n} //= (grep none(map &ffr, 1..$n), max(%s.values)+1..*)[0] }
|
||||
|
||||
say @ffr[1..10];
|
||||
my @ffr = map &ffr, 1..*;
|
||||
my @ffs = map &ffs, 1..*;
|
||||
|
||||
say "Rawks!" if (1...1000) eqv sort @ffr[1..40], @ffs[1..960];
|
||||
say @ffr[^10];
|
||||
say "Rawks!" if 1...1000 eqv sort |@ffr[^40], |@ffs[^960];
|
||||
|
|
|
|||
|
|
@ -0,0 +1,33 @@
|
|||
# Project : Hofstadter Figure-Figure sequences
|
||||
# Date : 2018/01/17
|
||||
# Author : Gal Zsolt (~ CalmoSoft ~)
|
||||
# Email : <calmosoft@gmail.com>
|
||||
|
||||
hofr = list(20)
|
||||
hofr[1] = 1
|
||||
hofs = []
|
||||
add(hofs,2)
|
||||
for n = 1 to 10
|
||||
hofr[n+1] = hofr[n] + hofs[n]
|
||||
if n = 1
|
||||
add(hofs,4)
|
||||
else
|
||||
for p = hofr[n] + 1 to hofr[n+1] - 1
|
||||
if p != hofs[n]
|
||||
add(hofs,p)
|
||||
ok
|
||||
next
|
||||
ok
|
||||
next
|
||||
see "First 10 values of R:" + nl
|
||||
showarray(hofr)
|
||||
see "First 10 values of S:" + nl
|
||||
showarray(hofs)
|
||||
|
||||
func showarray(vect)
|
||||
svect = ""
|
||||
for n = 1 to 10
|
||||
svect = svect + vect[n] + " "
|
||||
next
|
||||
svect = left(svect, len(svect) - 1)
|
||||
see svect + nl
|
||||
Loading…
Add table
Add a link
Reference in a new issue