1,2

Robert Israel, Table of n, a(n) for n = 1..10000

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

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

a(n) = A091222(A000051(n)).

a(n) = Sum_{d|n} A318622(d). - Robert Israel, Aug 30 2018

h:= proc(n) option remember; numtheory:-phi(n)/numtheory:-order(2, n/2^padic:-ordp(n, 2)) end proc:

f:= n -> add(h(d), d=numtheory:-divisors(n)):

map(f, [$1..100]); # Robert Israel, Aug 30 2018

Cf. A000374 gives the number of distinct irreducible factors of the same polynomials.

Sequence in context: A330631 A214560 A152858 * A082991 A214212 A100008

Adjacent sequences: A091245 A091246 A091247 * A091249 A091250 A091251

nonn

Antti Karttunen, Jan 03 2004

approved