Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070921
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070921 Card{ (x,y,z,u,v) | LCM(x,y,z,u,v)=n } where LCM(x,y,z,u,v) denote the least common multiple common of (x,y,z,u,v). +0
2
1, 31, 31, 211, 31, 961, 31, 781, 211, 961, 31, 6541, 31, 961, 961, 2101, 31, 6541, 31, 6541, 961, 961, 31, 24211, 211, 961, 781, 6541, 31, 29791, 31, 4651, 961, 961, 961, 44521, 31, 961, 961, 24211, 31, 29791, 31, 6541, 6541, 961, 31, 65131, 211, 6541 (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)^5*A008683(n/d)); Sum(k>0, a(k)/k^s)=1/zeta(s)*Sum(k>0, tau(k)^5/k^s)

PROGRAM

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

CROSSREFS

Cf. A048691.

Sequence in context: A085320 A040931 A022365 this_sequence A133782 A022401 A042936

Adjacent sequences: A070918 A070919 A070920 this_sequence A070922 A070923 A070924

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research