A106495 Number of leaves in GF(2)[X] superfactorization of n.

1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 3, 1, 2, 2, 2, 1, 2, 2, 2, 2, 3, 1, 2, 2, 2, 1, 2, 2, 3, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 2, 3, 1, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 3, 2, 2, 1, 2, 3, 2, 2, 3, 1, 2, 2, 3, 1, 3, 2, 2, 2, 2, 1, 3, 2, 2, 3, 2

Offset

1,6

Links

Table of n, a(n) for n=1..102.

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

Formula

a(n) = A106494(n)-A106493(n).

Crossrefs

a(n) = A064372(A106445(n)). After n=1 differs from A091221 for the first time at n=64, where A091221(64)=1, while a(64)=2.

Sequence in context: A265210 A023396 A091221 * A100428 A325169 A322862

Adjacent sequences: A106492 A106493 A106494 * A106496 A106497 A106498

Keyword

nonn

Author

Antti Karttunen, May 09 2005

Status

approved