|
|
A179527
|
|
Characteristic function of numbers in A083207.
|
|
5
|
|
|
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
let n such that a(n)=1 and m coprime to n, then a(m*n)=1, this was proved by R. Gerbicz (lemma for proving A179529(n)>0).
|
|
LINKS
|
|
|
MATHEMATICA
|
ZumkellerQ[n_] := Module[{d = Divisors[n], t, ds, x}, ds = Total[d]; If[Mod[ds, 2] > 0, False, t = CoefficientList[Product[1 + x^i, {i, d}], x]; t[[1 + ds/2]] > 0]];
a[n_] := Boole[ZumkellerQ[n]];
|
|
PROG
|
(Other) PolyML (the leading dots are just for readability):
... let fun ch(m, k) =
........... if k <= m
.............. then ch(m, k+1) orelse (n mod k = 0 andalso ch(m-k, k+1))
.............. else (m = 0)
.......... then 1
.......... else 0
... end;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|