The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A305822 Number of irreducible factors (counted with multiplicity) of the (0,1)-polynomial encoded in the binary expansion of n has when it is factored over Q. 1
 0, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 4, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 3, 3, 1, 3, 1, 5, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 5, 2, 2, 2, 3, 1, 4, 1, 4, 2, 2, 1, 4, 1, 2, 3, 6, 2, 3, 1, 3, 1, 3, 1, 5, 1, 2, 3, 3, 1, 3, 1, 5, 1, 2, 1, 4, 2, 2, 1, 4, 1, 4, 1, 3, 2, 2, 2, 6, 1, 3, 3, 3, 1, 3, 1, 4, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA For all n >= 1, a(n) >= A206719(n). PROG (PARI) A305822(n) = vecsum(factor(Pol(binary(n)))[, 2]); CROSSREFS Cf. A206074 (gives the positions of 1's), A206719, A257000, A304751. Cf. also A001222, A091222. Differs from A277013 for the first time at n=65, where a(65) = 2, while A277013(65) = 1. Sequence in context: A122810 A179953 A277013 * A326190 A086436 A001222 Adjacent sequences:  A305819 A305820 A305821 * A305823 A305824 A305825 KEYWORD nonn AUTHOR Antti Karttunen, Jun 10 2018 STATUS approved

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

Last modified August 2 06:06 EDT 2021. Contains 346409 sequences. (Running on oeis4.)