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!)
A294883 Number of divisors of n that are irreducible when their binary expansion is interpreted as polynomial over GF(2). 5
0, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 0, 2, 1, 1, 2, 2, 0, 2, 1, 2, 1, 2, 0, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 3, 0, 2, 1, 1, 1, 2, 1, 2, 1, 2, 0, 2, 2, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 3, 1, 1, 1, 2, 0, 2, 1, 2, 2, 2, 2, 3, 0, 1, 1, 2, 0, 3, 0, 1, 2, 2, 0, 2, 3, 1, 2, 2, 1, 2, 1, 2, 2, 2, 0, 2, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
COMMENTS
Number of terms of A014580 that divide n.
LINKS
FORMULA
a(n) = Sum_{d|n} A091225(d).
a(n) + A294884(n) = A000005(n).
a(n) = A294881(n) + A091225(n).
PROG
(PARI) A294883(n) = sumdiv(n, d, polisirreducible(Mod(1, 2)*Pol(binary(d))));
CROSSREFS
Cf. A091209 (gives a subset of zeros).
Cf. also A234741, A234742, A294893.
Sequence in context: A124148 A174435 A330749 * A348940 A088530 A058060
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 15:28 EDT 2024. Contains 371254 sequences. (Running on oeis4.)