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!)
A294882 Number of proper divisors of n that are not irreducible when their binary expansion is interpreted as polynomial over GF(2). 5
0, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 3, 1, 3, 1, 4, 1, 1, 1, 5, 2, 1, 2, 3, 1, 5, 1, 4, 1, 2, 2, 6, 1, 1, 1, 6, 1, 4, 1, 3, 4, 2, 1, 7, 1, 3, 2, 3, 1, 5, 2, 5, 1, 2, 1, 9, 1, 1, 3, 5, 2, 4, 1, 4, 2, 5, 1, 9, 1, 1, 3, 3, 1, 4, 1, 8, 3, 1, 1, 8, 3, 2, 2, 5, 1, 9, 1, 4, 1, 1, 2, 9, 1, 3, 3, 6, 1, 5, 1, 5, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
LINKS
FORMULA
a(n) = Sum_{d|n, d<n} (1-A091225(d)).
a(n) + A294881(n) = A032741(n).
For n > 1, a(n) = A294884(n) + A091225(n) - 1.
PROG
(PARI) A294882(n) = sumdiv(n, d, (d<n) * !polisirreducible(Mod(1, 2)*Pol(binary(d))));
CROSSREFS
Cf. also A234741, A234742, A294892.
Sequence in context: A239701 A303755 A321279 * A048220 A182593 A201167
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 April 23 12:27 EDT 2024. Contains 371912 sequences. (Running on oeis4.)