Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008966
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A008966 1 if n is square-free, else 0. +0
27
1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24=2^3*3 and 375=3*5^3 both have prime signature (3,1).

An infinite lower triangular matrix with A008966 in the main diagonal and the rest zeros = the square of triangle A143255 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 02 2008]

a(n) = 1 - A107078(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 03 2008]

LINKS

Daniel Forgues, Table of n, a(n) for n=1..100000

Index entries for characteristic functions

Eric Weisstein's World of Mathematics, Moebius Function

FORMULA

Dirichlet g.f. zeta(s)/zeta(2s).

a(n) = abs(mu(n)), where mu is the Moebius function (A008683).

a(n) = 0^(bigomega(n)-omega(n)), where bigomega(n) and omega(n) are the numbers of prime factors of n with and without repetition (A001222, A001221, A046660). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 05 2003

Multiplicative with p^e -> 0^(e-1), p prime and e>0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 15 2003

a(n) = 0^(A046951(n)-1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2007

PROGRAM

(MuPAD) func(abs(numlib::moebius(n)), n):

(MAGMA) [ Abs(MoebiusMu(n)) : n in [1..100]];

(PARI) a(n)=if(n<1, 0, direuler(p=2, n, 1+X))[n]

CROSSREFS

Cf. A008683, A008836.

Sequence in context: A130047 A157657 A008683 this_sequence A080323 A069158 A133639

Adjacent sequences: A008963 A008964 A008965 this_sequence A008967 A008968 A008969

KEYWORD

easy,nonn,mult

AUTHOR

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

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 November 21 21:21 EST 2009. Contains 167310 sequences.


AT&T Labs Research