login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092673 a(n) = moebius(n)- moebius(n/2) where moebius(n) is zero if n is not an integer. 10
1, -2, -1, 1, -1, 2, -1, 0, 0, 2, -1, -1, -1, 2, 1, 0, -1, 0, -1, -1, 1, 2, -1, 0, 0, 2, 0, -1, -1, -2, -1, 0, 1, 2, 1, 0, -1, 2, 1, 0, -1, -2, -1, -1, 0, 2, -1, 0, 0, 0, 1, -1, -1, 0, 1, 0, 1, 2, -1, 1, -1, 2, 0, 0, 1, -2, -1, -1, 1, -2, -1, 0, -1, 2, 0, -1, 1, -2, -1, 0, 0, 2, -1, 1, 1, 2, 1, 0, -1, 0, 1, -1, 1, 2, 1, 0, -1, 0, 0, 0, -1, -2, -1, 0, -1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Setting x=1 gives us phi(n) (A000010). Setting x=0 gives A092674.

Apparently the Dirichlet inverse of A001511. - R. J. Mathar, Dec 22 2010

Given A = A115359 as an infinite lower triangular matrix and B = the Mobius sequence as a vector, A092673 = A*B. - Gary W. Adamson, Mar 14 2011

LINKS

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

M. Somos, Introduction to Ramanujan theta functions

Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

FORMULA

Let t(n)=binomial(n+1,2); s[1]=x; for i >= 2, s[i]=t(i)-sum_{j=1..i-1} s[j]*floor(i/j); a(n) = coefficient of x in s[n]. - Jon Perry

a(n) is multiplicative with a(2)= -2, a(4)= 1, a(2^e)= 0 if e>2. a(p)= -1, a(p^e)= 0 if e>1, p>2. - Michael Somos, Mar 26 2007

a(8*n)= 0. a(2*n + 1) = moebius(2*n + 1). a(2*n) = moebius(2*n) - moebius(n). - Michael Somos, Mar 26 2007

|a(n)| <= 2.

1 / (1 + x) = Product_{k>0} f(-x^k)^a(k) where f() is a Ramanujan theta function. - Michael Somos, Mar 26 2007

Dirichlet g.f.: (1-2^(-s))/zeta(s). - Ralf Stephan, Mar 24 2015

EXAMPLE

The first few s[n] are:

x, -2*x + 3, -x + 3, x + 1, -x + 5, 2*x, -x + 7, 4, 6, 2*x + 2, -x + 11, -x + 5, -x + 13, 2*x + 4, x + 7, 8, -x + 17, 6, -x + 19, -x + 9, x + 11, 2*x + 8, -x + 23, 8, 20, 2*x + 10, 18, -x + 13, -x + 29, -2*x + 10, -x + 31, 16, x + 19.

x - 2*x^2 - x^3 + x^4 - x^5 + 2*x^6 - x^7 + 2*x^10 - x^11 +...

MAPLE

A092673:= proc(n) if n::odd then numtheory:-mobius(n) else numtheory:-mobius(n) - numtheory:-mobius(n/2) fi end proc:

map(A092673, [$1..100]); # Robert Israel, Dec 31 2015

MATHEMATICA

f[n_] := MoebiusMu[n] - If[OddQ@n, 0, MoebiusMu[n/2]]; Array[f, 105] (* Robert G. Wilson v *)

PROG

(PARI) s=vector(2000); t(n)=binomial(n+1, 2); s[1]=x; for(i=2, 2000, s[i]=t(i)-sum(j=1, i-1, s[j]*floor(i/j))); for(i=1, 2000, print1(", "polcoeff(s[i], 1)))

(PARI) {a(n) = if( n<1, 0, moebius(n) - if( n%2, 0, moebius(n/2)))} /* Michael Somos, Mar 26 2007 */

(PARI) {a(n) = local(A, B, m); if( n<1, 0, A = x * O(x^n); B = 1 + x + A; for( k=1, n, B *= eta(x^k + A)^( m = polcoeff(B, k))); m)} /* Michael Somos, Mar 26 2007 */

(PARI) a(n)=my(o=valuation(n%8, 2)); if(o==0, moebius(n), if(o==1, 2*moebius(n), if(o==2, moebius(n/4), 0))) \\ Charles R Greathouse IV, Feb 07 2013

CROSSREFS

Cf. A008683 (moebius(n)), A092674, A115359.

Sequence in context: A163819 A281185 A260683 * A243842 A112400 A219185

Adjacent sequences:  A092670 A092671 A092672 * A092674 A092675 A092676

KEYWORD

sign,mult

AUTHOR

Jon Perry, Mar 02 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 25 00:41 EDT 2017. Contains 288708 sequences.