login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182910 Number of unitary prime divisors of the swinging factorial (A056040) n$ = n! / floor(n/2)!^2. 1
0, 0, 1, 2, 2, 3, 1, 2, 3, 3, 1, 2, 3, 4, 3, 3, 4, 5, 4, 5, 4, 6, 5, 6, 5, 5, 4, 4, 3, 4, 5, 6, 7, 8, 6, 6, 7, 8, 7, 7, 8, 9, 9, 10, 9, 7, 6, 7, 7, 7, 7, 8, 7, 8, 8, 10, 11, 13, 12, 13, 11, 12, 11, 10, 11, 13, 12, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

A prime divisor of n is unitary iff its exponent is 1 in the prime power factorization of n. A unitary prime divisor of the swinging factorial n$ can be smaller than n/2. For n >= 30 the swinging factorial has more unitary prime divisors than the factorial and it has never less unitary prime divisors. Thus a(n) >= PrimePi(n) - PrimePi(n/2).

LINKS

Table of n, a(n) for n=0..67.

EXAMPLE

16$ = 2.3.3.5.11.13. So 16$ has one non-unitary prime divisor and a(16) = 4.

MAPLE

UnitaryPrimeDivisor := proc(f, n) local k, F; F := f(n):

add(`if`(igcd(iquo(F, k), k)=1, 1, 0), k=numtheory[factorset](F)) end;

A056040 := n -> n!/iquo(n, 2)!^2;

A182910 := n -> UnitaryPrimeDivisor(A056040, n);

seq(A182910(i), i=1..LEN);

CROSSREFS

Cf. A056171.

Sequence in context: A226743 A166269 A181648 * A055460 A067514 A115323

Adjacent sequences:  A182907 A182908 A182909 * A182911 A182912 A182913

KEYWORD

nonn

AUTHOR

Peter Luschny, Mar 14 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified July 28 16:32 EDT 2014. Contains 245003 sequences.