login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294881 Number of proper divisors of n that are irreducible when their binary expansion is interpreted as polynomial over GF(2). 5
0, 0, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 2, 1, 1, 0, 2, 0, 1, 2, 2, 0, 2, 0, 2, 1, 2, 0, 2, 0, 1, 2, 1, 1, 2, 0, 2, 2, 1, 0, 3, 0, 2, 1, 1, 0, 2, 1, 2, 1, 2, 0, 2, 1, 2, 2, 1, 0, 2, 0, 2, 2, 1, 1, 3, 0, 1, 1, 2, 0, 2, 0, 2, 2, 2, 2, 3, 0, 1, 1, 2, 0, 3, 0, 1, 1, 2, 0, 2, 2, 1, 2, 2, 1, 2, 0, 2, 2, 2, 0, 2, 0, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = Sum_{d|n, d < n} A091225(d).
a(n) + A294882(n) = A032741(n).
a(n) = A294883(n) - A091225(n).
PROG
(PARI) A294881(n) = sumdiv(n, d, (d<n) * polisirreducible(Mod(1, 2) * Pol(binary(d))));
CROSSREFS
Cf. also A234741, A234742, A294891.
Sequence in context: A340832 A063962 A084114 * A355523 A110475 A366739
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 09 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 17:25 EDT 2024. Contains 371254 sequences. (Running on oeis4.)