This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091220 Number of divisors of the n-th GF(2)[X]-polynomial. 10
 1, 2, 2, 3, 3, 4, 2, 4, 4, 6, 2, 6, 2, 4, 4, 5, 5, 8, 2, 9, 3, 4, 4, 8, 2, 4, 6, 6, 4, 8, 2, 6, 4, 10, 4, 12, 2, 4, 6, 12, 2, 6, 4, 6, 8, 8, 2, 10, 4, 4, 6, 6, 4, 12, 2, 8, 6, 8, 2, 12, 2, 4, 6, 7, 9, 8, 2, 15, 3, 8, 4, 16, 2, 4, 8, 6, 4, 12, 4, 15, 3, 4, 8, 9, 7, 8, 2, 8, 4, 16, 2, 12, 4, 4, 6, 12, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS A. Karttunen, Scheme-program for computing this sequence. PROG (PARI) a(n)=local(p, fm, k); while(n>0, p+=Mod(n, 2)*x^k; n\=2; k++); fm=factor(p); prod(k=1, matsize(fm)[1], fm[k, 2]+1) \\ Franklin T. Adams-Watters, Jun 22 2010 CROSSREFS a(n) = A000005(A091203(n)) = A000005(A091205(n)). Cf. A091257. Sequence in context: A106494 A015135 A116619 * A057955 A305788 A116473 Adjacent sequences:  A091217 A091218 A091219 * A091221 A091222 A091223 KEYWORD nonn AUTHOR Antti Karttunen, Jan 03 2004 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 January 17 22:51 EST 2019. Contains 319251 sequences. (Running on oeis4.)