|
|
A065803
|
|
a(n) = (sigma_2(n) mod 2) * (sigma_2(n) mod 5). Residue-product modulo 2 and 5 of sum of square of divisors.
|
|
2
|
|
|
1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,121
|
|
COMMENTS
|
If n is square then sigma_2(n) is divisible by neither 2 nor 5. The product of residues is not always one. E.g., sigma_2(121) = 14673; mod 2 and mod 5 gives 1 and 3 residues. a(n)=3 for n=121, 361, 484, 841, 961 etc..
a(n)=4 for n=43681, 101761, 116281, 174724, 203401, 303601, 346921, ... - R. J. Mathar, Apr 02 2011
|
|
REFERENCES
|
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
A001157 := proc(n) numtheory[sigma][2](n) ; end proc:
|
|
MATHEMATICA
|
Array[Mod[#, 2] Mod[#, 5] &@ DivisorSigma[2, #] &, 121] (* Michael De Vlieger, Jan 19 2020 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|