This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A305822 #9 Jun 10 2018 21:15:35 %S A305822 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, %T A305822 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, %U A305822 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 %N 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. %H A305822 Antti Karttunen, <a href="/A305822/b305822.txt">Table of n, a(n) for n = 1..65537</a> %F A305822 For all n >= 1, a(n) >= A206719(n). %o A305822 (PARI) A305822(n) = vecsum(factor(Pol(binary(n)))[, 2]); %Y A305822 Cf. A206074 (gives the positions of 1's), A206719, A257000, A304751. %Y A305822 Cf. also A001222, A091222. %Y A305822 Differs from A277013 for the first time at n=65, where a(65) = 2, while A277013(65) = 1. %K A305822 nonn %O A305822 1,4 %A A305822 _Antti Karttunen_, Jun 10 2018