0,2

Equivalently, number of output sequences with primitive period n from a simple cycling shift register.

Also, the number of nonempty subsets A of the set of the integers 1 to n such that gcd(A) is relatively prime to n (for n>=1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 13 2006

E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, NY, 1968, p. 84.

E. N. Gilbert and J. Riordan, Symmetry types of periodic sequences, Illinois J. Math., 5 (1961), 657-665.

S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967.

T. D. Noe, Table of n, a(n) for n=0..300

J.-P. Allouche, Note on the transcendence of a generating function. In A. Laurincikas and E. Manstavicius, editors, Proceedings of the Palanga Conference for the 75th birthday of Prof. Kubilius, New trends in Probab. and Statist., Vol. 4, pages 461-465, 1997.

M. B. Nathanson, Primitive sets and and Euler phi function for subsets of {1,2,...,n}, math.NT/0608150

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 85

Sum mu(d)*2^(n/d); d divides n.

A027375(p)=A000225(p)-1 if p is a prime number. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 13 2006

a(3) = 6 = |{ 001, 010, 001, 011, 010, 110 }|

Table[ Apply[ Plus, MoebiusMu[ n / Divisors[n] ]*2^Divisors[n] ], {n, 1, 32} ]

Essentially the same as A038199. Equals n*A001037(n).

Cf. A056267.

Cf. A020921.

Adjacent sequences: A027372 A027373 A027374 this_sequence A027376 A027377 A027378

Sequence in context: A019311 A052994 A088219 this_sequence A059727 A103872 A159322

nonn,nice,easy

N. J. A. Sloane (njas(AT)research.att.com).

Comments from Frank Ruskey (fruskey(AT)cs.uvic.ca), Jan 17 2000