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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070536 Number of terms in n-th cyclotomic polynomial minus largest prime factor of n; a(1)=1 by convention. 2
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 4, 0, 10, 0, 0, 0, 4, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 6, 0, 0, 0, 6, 0, 6, 0, 0, 2, 0, 0, 2, 0, 18, 4, 0, 0, 8, 10, 0, 0, 0, 0, 2, 0, 20, 4, 0, 0, 0, 0, 0, 2, 24, 0, 10, 0, 0, 2, 10, 0, 10, 0, 12, 0, 0, 0, 4 (list; graph; refs; listen; history; internal format)
OFFSET

1,15

COMMENTS

When (as at n=105) coefficients are not equal 1 or -1 then terms in C[n,x] are counted with multiplicity.

EXAMPLE

n=21: Cyclotomic[21,x]=1-x+x^3-x^4+x^6-x^8+x^9-x^11+x^12 has 9 terms while largest prime factor of 21 is 7

CROSSREFS

a(n)=A051664[n]-A06530[n].

Cf. A006530, A051664, A070537, A070776.

Sequence in context: A151756 A112053 A089798 * A030201 A055668 A045839

Adjacent sequences:  A070533 A070534 A070535 * A070537 A070538 A070539

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 03 2002

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

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

Last modified February 17 02:08 EST 2012. Contains 205978 sequences.