This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
b:= proc(n, i) option remember; `if`(n=0, {1},
`if`(i<1, {}, {seq(map(x->ilcm(x, `if`(j=0, 1, i)),
b(n-i*j, i-1))[], j=0..n/i)}))
end:
a:= n-> max(select(x-> irem(x, n)=0, b(n$2))[]):
seq(a(n), n=1..50); # Alois P. Heinz, May 26 2013
b[n_, i_] := b[n, i] = If[n==0, {1}, If[i<1, {}, Union @ Flatten @ Table[ Map[ Function[{x}, LCM[x, If[j==0, 1, i]]], b[n-i*j, i-1]], {j, 0, n/i}]]]; a[n_] := Max[Select[b[n, n], Mod[#, n]==0&]]; Table[a[n], {n, 1, 50}] (* Jean-François Alcover, Jul 29 2015, after Alois P. Heinz *)
(define (A225646 n) (let ((maxlcm (list 1))) (fold_over_partitions_of n n lcm (lambda (p) (set-car! maxlcm (max (car maxlcm) p)))) (car maxlcm))) (define (fold_over_partitions_of m initval addpartfun colfun) (let recurse ((m m) (b m) (n 0) (partition initval)) (cond ((zero? m) (colfun partition)) (else (let loop ((i 1)) (recurse (- m i) i (+ 1 n) (addpartfun i partition)) (if (< i (min b m)) (loop (+ 1 i))))))))
b:= proc(n, i) option remember; `if`(n=0, {1},
`if`(i<1, {}, {seq(map(x->ilcm(x, `if`(j=0, 1, i)),
b(n-i*j, i-1))[], j=0..n/i)}))
end:
a:= n-> max(select(x-> irem(x, n)=0, b(n$2))[])/n:
seq(a(n), n=1..50); # Alois P. Heinz, May 25 2013
b[n_, i_] := b[n, i] = If[n==0, {1}, If[i<1, {}, Union @ Flatten @ Table[ Map[ Function[{x}, LCM[x, If[j==0, 1, i]]], b[n-i*j, i-1]], {j, 0, n/i}]]]; a[n_] := Max[Select[b[n, n], Mod[#, n]==0&]]/n; Table[a[n], {n, 1, 50}] (* Jean-François Alcover, Jul 29 2015, after Alois P. Heinz *)
(define (A225656 n) (/ (A225655 n) (max 1 n)))
Comments