Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070919
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070919 Card{ (x,y,z) | LCM(x,y,z)=n } where LCM(x,y,z) denote the least common multiple common divisor of (x,y,z). +0
5
1, 7, 7, 19, 7, 49, 7, 37, 19, 49, 7, 133, 7, 49, 49, 61, 7, 133, 7, 133, 49, 49, 7, 259, 19, 49, 37, 133, 7, 343, 7, 91, 49, 49, 49, 361, 7, 49, 49, 259, 7, 343, 7, 133, 133, 49, 7, 427, 19, 133, 49, 133, 7, 259, 49, 259, 49, 49, 7, 931, 7, 49, 133, 127, 49, 343, 7, 133 (list; graph; listen)
OFFSET

1,2

COMMENT

A048691(n) gives Card{ (x,y) | LCM(x,y)=n }

FORMULA

a(n)=Sum(d|n, A000005(d)^3*A008683(n/d)); Sum(k>0, a(k)/k^s)=1/zeta(s)*Sum(k>0, tau(k)^3/k^s)

PROGRAM

(PARI) for(n=1, 100, print1(sumdiv(n, d, numdiv(d)^3*moebius(n/d)), ", "))

CROSSREFS

Cf. A048691.

Sequence in context: A100635 A165138 A139126 this_sequence A070847 A053416 A094248

Adjacent sequences: A070916 A070917 A070918 this_sequence A070920 A070921 A070922

KEYWORD

mult,easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research