Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091220
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091220 Number of divisors of the n-th GF(2)[X]-polynomial. +0
5
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; listen)
OFFSET

1,2

LINKS

A. Karttunen, Scheme-program for computing this sequence.

Index entries for sequences operating on GF(2)[X]-polynomials

CROSSREFS

a(n) = A000005(A091203(n)) = A000005(A091205(n)). Cf. A091257.

Sequence in context: A106494 A015135 A116619 this_sequence A057955 A116473 A006546

Adjacent sequences: A091217 A091218 A091219 this_sequence A091221 A091222 A091223

KEYWORD

nonn

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), Jan 03 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research