Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078708
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078708 Sum of divisors d of n such that n/d is not congruent to 0 mod 3. +0
1
1, 3, 3, 7, 6, 9, 8, 15, 9, 18, 12, 21, 14, 24, 18, 31, 18, 27, 20, 42, 24, 36, 24, 45, 31, 42, 27, 56, 30, 54, 32, 63, 36, 54, 48, 63, 38, 60, 42, 90, 42, 72, 44, 84, 54, 72, 48, 93, 57, 93, 54, 98, 54, 81, 72, 120, 60, 90, 60, 126, 62, 96, 72, 127, 84, 108, 68, 126, 72, 144 (list; graph; listen)
OFFSET

1,2

FORMULA

G.f.: Sum_{k>0} x^k*(1+x^k)^2*(1+x^(2*k))/(1-x^(3*k))^2.

a(n)=(A000203(3*n)-A000203(n))/3. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Dec 22 2003

PROGRAM

(PARI) for(n=1, 70, d=divisors(n); s=0; for(j=1, matsize(d)[2], if((n/d[j])%3>0, s=s+d[j])); print1(s, ", "))

(PARI) a(n)=sumdiv(n, d, if((n/d)%3, 1, 0)*d)

CROSSREFS

Cf. A046913, A035191.

Sequence in context: A106477 A098043 A045773 this_sequence A096273 A069981 A000199

Adjacent sequences: A078705 A078706 A078707 this_sequence A078709 A078710 A078711

KEYWORD

mult,easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Dec 18 2002

EXTENSIONS

Extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Benoit Cloitre, Dec 20 2002

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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research