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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046897 Sum of divisors of n that are not divisible by 4. 8
1, 3, 4, 3, 6, 12, 8, 3, 13, 18, 12, 12, 14, 24, 24, 3, 18, 39, 20, 18, 32, 36, 24, 12, 31, 42, 40, 24, 30, 72, 32, 3, 48, 54, 48, 39, 38, 60, 56, 18, 42, 96, 44, 36, 78, 72, 48, 12, 57, 93, 72, 42, 54, 120, 72, 24, 80, 90, 60, 72, 62, 96, 104, 3, 84, 144, 68, 54, 96, 144, 72 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Ramanujan theta functions: f(q) := Prod_{k>=1} (1-(-q)^k) (see A121373), phi(q) := theta_3(q) := Sum_{k=-oo..oo} q^(k^2) (A000122), psi(q) := Sum_{k=0..oo} q^(k*(k+1)/2) (A10054), chi(q) := Prod_{k>=0} (1+q^(2k+1)) (A000700).

REFERENCES

J. M. Borwein, D. H. Bailey and R. Girgensohn, Experimentation in Mathematics, A K Peters, Ltd., Natick, MA, 2004. x+357 pp. See p. 194.

P. A. MacMahon, Combinatory Analysis, Cambridge Univ. Press, London and New York, Vol. 1, 1915 and Vol. 2, 1916; see vol. 2, p 31, Article 273.

LINKS

M. Somos, Introduction to Ramanujan theta functions

Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

FORMULA

a(n) = (-1)^(n+1)*Sum_{d divides n} (-1)^(n/d+d)*d. Multiplicative with a(2^e) = 3, a(p^e) = (p^(e+1)-1)/(p-1) for an odd prime p. - Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 10 2002

G.f.: Sum_{k>0} x^k/(1+(-x)^k)^2, or Sum_{k>0} k*x^k/(1+(-x)^k). - Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 16 2002

Expansion of (1 - phi(q)^4) / 8 in powers of q where phi() is a Ramanujan theta function. - Michael Somos, Jan 25 2008

Equals inverse Mobius transform (A051731) of "count, 4*n = 0": (1, 2, 3, 0, 5, 6, 7, 0,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jul 03 2008

EXAMPLE

q + 3*q^2 + 4*q^3 + 3*q^4 + 6*q^5 + 12*q^6 + 8*q^7 + 3*q^8 + 13*q^9 + ...

MAPLE

A046897 := proc(n) if n mod 4 = 0 then numtheory[sigma](n)-4*numtheory[sigma](n/4) ; else numtheory[sigma](n) ; end if; end proc: # R. J. Mathar, Mar 23 2011

MATHEMATICA

a[n_] := Sum[ Boole[ !Divisible[d, 4]]*d, {d, Divisors[n]}]; Table[ a[n], {n, 1, 71}] (* From Jean-François Alcover, Dec 12 2011 *)

PROG

(PARI) a(n)=if(n<1, 0, sumdiv(n, d, if(d%4, d)))

CROSSREFS

a(n)=A000118(n)/8, n>0. Cf. A069733.

Cf. A051731.

Sequence in context: A073181 A183100 * A109506 A000113 A069915 A033634

Adjacent sequences:  A046894 A046895 A046896 * A046898 A046899 A046900

KEYWORD

nonn,mult

AUTHOR

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

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:25 EST 2012. Contains 205907 sequences.