Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048785
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048785 tau(n^3), where tau = number of divisors (A000005). +0
8
0, 1, 4, 4, 7, 4, 16, 4, 10, 7, 16, 4, 28, 4, 16, 16, 13, 4, 28, 4, 28, 16, 16, 4, 40, 7, 16, 10, 28, 4, 64, 4, 16, 16, 16, 16, 49, 4, 16, 16, 40, 4, 64, 4, 28, 28, 16, 4, 52, 7, 28, 16, 28, 4, 40, 16, 40, 16, 16, 4, 112, 4, 16, 28, 19, 16, 64, 4, 28, 16 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n)=sum(d|n, 3^omega(d)) where omega(x) is the number of distinct prime factors in factorization of x. - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 14 2002

Multiplicative with a(p^e) = 3e+1. Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu) Jun 09, 2005.

REFERENCES

David Johnson-Davies (david(AT)interface.co.uk)

CROSSREFS

Adjacent sequences: A048782 A048783 A048784 this_sequence A048786 A048787 A048788

Sequence in context: A010476 A020762 A053510 this_sequence A016711 A023404 A140245

KEYWORD

nonn,mult

AUTHOR

njas

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 October 16 16:43 EDT 2008. Contains 145098 sequences.


AT&T Labs Research