Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068074
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068074 a(n)=sum(d|n,(-1)^d*2^omega(n/d)) where omega(x) is the number of distinct prime factors in x factorization. +0
1
-1, -1, -3, 1, -3, -3, -3, 3, -5, -3, -3, 3, -3, -3, -9, 5, -3, -5, -3, 3, -9, -3, -3, 9, -5, -3, -7, 3, -3, -9, -3, 7, -9, -3, -9, 5, -3, -3, -9, 9, -3, -9, -3, 3, -15, -3, -3, 15, -5, -5, -9, 3, -3, -7, -9, 9, -9, -3, -3, 9, -3, -3, -15, 9, -9, -9, -3, 3, -9, -9, -3, 15, -3, -3, -15, 3, -9, -9, -3, 15, -9, -3, -3, 9, -9, -3, -9, 9, -3 (list; graph; listen)
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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research