Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056671
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056671 1 + the number of unitary and square-free divisors of n = number of divisors of reduced square-free part of n. +0
3
1, 2, 2, 1, 2, 4, 2, 1, 1, 4, 2, 2, 2, 4, 4, 1, 2, 2, 2, 2, 4, 4, 2, 2, 1, 4, 1, 2, 2, 8, 2, 1, 4, 4, 4, 1, 2, 4, 4, 2, 2, 8, 2, 2, 2, 4, 2, 2, 1, 2, 4, 2, 2, 2, 4, 2, 4, 4, 2, 4, 2, 4, 2, 1, 4, 8, 2, 2, 4, 8, 2, 1, 2, 4, 2, 2, 4, 8, 2, 2, 1, 4, 2, 4, 4, 4, 4, 2, 2, 4, 4, 2, 4, 4, 4, 2, 2, 2, 2, 1, 2, 8, 2, 2, 8 (list; graph; listen)
OFFSET

1,2

COMMENT

Note that 1 is regarded as free of prime squares and also a square number and it is also a unitary divisor.

LINKS

S. R. Finch, Unitarism and infinitarism.

FORMULA

Multiplicative with a(p)=2 and a(p^e)=1 for e>1. a(n)=2^A056169(n). - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 01 2001

EXAMPLE

n=252=2.2.3.3.7 has 18 divisors, 8 unitary and 8 square-free divisors of which 2 are unitary and square-free,divisors {1,7}; n=2520=2.2.2.3.3.5.7 has 48 divisors,16 unitary and 16 square-free divisors of which {1,5,7,35}, i.e. a(2520)=4

a(2520)=a(2^3*3^2*5*7)=a(2^3)*a(3^2)*a(5)*a(7)=1*1*2*2=4.

CROSSREFS

a(n) = A000005[A055231(n)] = A000005[A007913(n)/A055229(n)]

Sequence in context: A007427 A048106 A156260 this_sequence A055076 A069780 A066954

Adjacent sequences: A056668 A056669 A056670 this_sequence A056672 A056673 A056674

KEYWORD

mult,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 10 2000

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