Revision History for A211110
(Underlined text is an addition;
strikethrough text is a deletion.)
Showing entries 1-10
| older changes
|
|
|
|
#19 by Bruno Berselli at Tue Jun 30 06:16:01 EDT 2015
|
|
|
|
#18 by Michel Marcus at Tue Jun 30 05:47:08 EDT 2015
|
|
|
|
#17 by Michel Marcus at Tue Jun 30 05:46:59 EDT 2015
|
| PROG
|
(PARI) isokp(p, n) = {for (k=1, #p, if ((p[k]==1) || (n % p[k]), return (0)); ); return (1); }
a(n) = {my(nb = 0); forpart(p=n, if (isokp(p, n), nb++)); nb; } \\ Michel Marcus, Jun 30 2015
|
| STATUS
|
proposed
editing
|
|
|
|
#16 by Jean-François Alcover at Tue Jun 30 05:23:27 EDT 2015
|
|
|
|
#15 by Jean-François Alcover at Tue Jun 30 05:23:20 EDT 2015
|
| MATHEMATICA
|
a[n_] := Module[{b, l}, l = Rest[Divisors[n]]; b[m_, i_] := b[m, i] = If[m==0, 1, If[i<1, 0, b[m, i-1] + If[l[[i]]>m, 0, b[m-l[[i]], i]]]]; b[n, Length[l]]]; ]]]; a[0]=] = 1; Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Jun 30 2015, after Alois P. Heinz *)
|
|
|
|
#14 by Jean-François Alcover at Tue Jun 30 05:22:17 EDT 2015
|
| MATHEMATICA
|
a[n_] := Module[{b, l}, l = Rest[Divisors[n]]; b[m_, i_] := b[m, i] = If[m==0, 1, If[i<1, 0, b[m, i-1] + If[l[[i]]>m, 0, b[m-l[[i]], i]]]]; b[n, Length[l]]]; a[0]=1; Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Jun 30 2015, after Alois P. Heinz *)
|
| STATUS
|
approved
editing
|
|
|
|
#13 by Alois P. Heinz at Wed Feb 05 08:43:01 EST 2014
|
|
|
|
#12 by Alois P. Heinz at Wed Feb 05 08:42:57 EST 2014
|
| MAPLE
|
with(numtheory):
a:= proc(n) local b, l; l:= sort([(divisors(n) minus {1})[]]):
b:= proc(m, i) option remember; `if`(m=0, 1, `if`(i<1, 0,
b(m, i-1)+`if`(l[i]>m, 0, b(m-l[i], i))))
end; forget(b):
b(n, nops(l))
end:
seq(a(n), n=0..100); # Alois P. Heinz, Feb 05 2014
|
| STATUS
|
approved
editing
|
|
|
|
#11 by Alois P. Heinz at Wed Feb 05 08:35:10 EST 2014
|
|
|
|
#10 by Alois P. Heinz at Wed Feb 05 08:35:03 EST 2014
|
| LINKS
|
Alois P. Heinz, <a href="/A211110/b211110.txt">Table of n, a(n) for n = 0..10000</a>
|
|
|
|
|