cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A117223 Numbers n such that Phi(n,x) is a flat cyclotomic polynomial of order three.

Original entry on oeis.org

231, 399, 435, 465, 483, 651, 663, 741, 861, 885, 903, 915, 1113, 1173, 1209, 1281, 1311, 1335, 1353, 1443, 1479, 1533, 1581, 1599, 1653, 1743, 1833, 1947, 2163, 2211, 2235, 2247, 2265, 2301, 2337, 2379, 2409, 2485, 2667, 2685, 2715, 2829, 2877, 2915
Offset: 1

Views

Author

T. D. Noe, Mar 04 2006

Keywords

Comments

A flat polynomial is defined to be a polynomial whose coefficients are -1, 0, or 1. Order three means that n is the product of three odd primes p < q < r. Bachman shows that for each p there are an infinite number of pairs {q,r} that generate flat cyclotomic polynomials. It is well known that all cyclotomic polynomials of orders one and two are flat. There are no flat cyclotomic polynomials of order four for n < 10^5.
Kaplan shows that the sequence also includes pqr if r = +-1 (mod pq). Sequence A160353 lists the subsequence of all odd numbers of this form, while A160355 lists the elements which are not of this form. More cases are covered by David Broadhurst's conjectures, cf. link. - M. F. Hasler, May 15 2009

Crossrefs

Cf. A117318 (fourth-order flat cyclotomic polynomials).

Programs

  • Mathematica
    IsOrder3[n_] := (n>1) && OddQ[n] && Transpose[FactorInteger[n]][[2]] == {1,1,1}; PolyHeight[p_] := Max[Abs[CoefficientList[p,x]]]; Clear[x]; Select[Range[4000], IsOrder3[ # ] && PolyHeight[Cyclotomic[ #,x]]==1&]
  • PARI
    A117223(n,show=0)={ my(pqr=1,f); while(n, matsize(f=factor(pqr+=2))[1]==3 & vecmax(f[,2])==1 & vecmax(abs(Vec(polcyclo(pqr))))==1 & n-- & show & print1(pqr", ")); pqr } \\ M. F. Hasler, May 15 2009

Formula

Equals A160353 union A160355 = A160350 \ A075819 = A160350 intersect A046389. - M. F. Hasler, May 15 2009

A160352 Numbers of the form pqr, where p

Original entry on oeis.org

30, 42, 66, 78, 102, 110, 114, 138, 174, 182, 186, 190, 222, 246, 258, 282, 290, 310, 318, 354, 366, 402, 406, 410, 426, 435, 438, 465, 474, 498, 506, 534, 574, 582, 590, 602, 606, 610, 618, 642, 654, 678, 710, 762, 786, 790, 822, 834, 861, 885, 890, 894
Offset: 1

Views

Author

M. F. Hasler, Jun 03 2009

Keywords

Comments

A subsequence of A007304. The odd terms are listed in A160353.

Crossrefs

Programs

  • PARI
    for( pqr=1, 1999, my(f=factor(pqr)); #f~==3 & vecmax(f[, 2])==1 & abs((f[3, 1]+1)%(f[1, 1]*f[2, 1])-1)==1 & print1(pqr ", "))

A160355 Odd indices pqr of flat cyclotomic polynomials of order 3 which are not of the form r = +/-1 (mod pq).

Original entry on oeis.org

231, 399, 483, 651, 663, 741, 1113, 1173, 1209, 1281, 1311, 1353, 1443, 1479, 1533, 1581, 1599, 1653, 1833, 1947, 2163, 2247, 2301, 2337, 2379, 2409, 2829, 2877, 2915, 3129, 3297, 3363, 3441, 3531, 3621, 3723, 3759, 3783, 3813, 4011, 4029, 4071, 4161
Offset: 1

Views

Author

M. F. Hasler, May 11 2009

Keywords

Comments

This is in some sense the nontrivial part of A160350: Indeed, Kaplan (2007) has shown that Phi[pqr] has coefficients in {0,1,-1} if r = +-1 (mod pq), where pA160350 (i.e. of A117223) which do not satisfy this equality (i.e. which are not in A160353).
See A160350 for further details and references.

Examples

			a(1)=231=3*7*11 is the smallest "nontrivial" element of A160350 in the sense that it is neither of the form 2pq, and that its largest factor (11) is not congruent to +- 1 modulo the product of the smaller factors (3*7).
		

Crossrefs

Programs

  • PARI
    forstep( pqr=1,5999,2, my(f=factor(pqr)); #f~==3 & vecmax(f[,2])==1 & abs((f[3,1]+1)%(f[1,1]*f[2,1])-1)!=1 & vecmax(abs(Vec(polcyclo(pqr))))==1 & print1(pqr","))

Formula

Equals A117223 \ A160353 = A160354 intersect A046389.
Showing 1-3 of 3 results.