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.

A206710 This irregular table contains indices j, k, l,... in each row such that the values Phi(j,-m) < Phi(k,-m)< Phi(l,-m)< ... of cyclotomic polynomials Phi(.,.) are sorted given any constant integer argument m >= 2.

This page as a plain text file.
%I A206710 #41 Mar 31 2012 10:23:48
%S A206710 1,2,3,4,6,5,12,8,10,7,9,18,14,30,20,24,16,15,11,22,42,13,28,36,21,26,
%T A206710 17,40,48,32,60,34,19,27,54,38,66,44,25,50,33,23,46,70,78,52,90,56,72,
%U A206710 45,84,39,35,29,58,31,62,102,68,80,96,64,120
%N A206710 This irregular table contains indices j, k, l,... in each row such that the values Phi(j,-m) < Phi(k,-m)< Phi(l,-m)< ... of cyclotomic polynomials Phi(.,.) are sorted given any constant integer argument m >= 2.
%C A206710 Based on A002202 "Values taken by totient function phi(m)", A000010 can only take certain even numbers. So for the worst case, the largest Phi(k,m) with degree d (even positive integer) will be (1-k^(d+1))/(1-k) (or smaller)and the smallest Phi(k,m) with degree d+2 will be (1+k^(d+3))/(1+k) (or larger).
%C A206710 (1+k^(d+3))/(1+k)-(1-k^(d+1))/(1-k)=(k/(k^2-1))*(2+k^d*(k^3-(k^2+k+1)))
%C A206710 k^3>k^2+k+1 when k>=2.
%C A206710 This means that this sequence can be segmented to sets in which Cyclotomic(k,m) shares the same degree of Polynomial and it can be generated in this way.
%e A206710 For those k's that make A000010(k) = 1
%e A206710 Phi(1,-m) = -1-m
%e A206710 Phi(2,-m) = 1-m
%e A206710 Phi(1,-m) < Phi(2,-m)
%e A206710 So, a(1) = 1, a(2) = 2;
%e A206710 For those k's (k > 2) that make A000010(k) = 2
%e A206710 Phi(3,-m) = 1 - m + m^2
%e A206710 Phi(4,-m) = 1 + m^2
%e A206710 Phi(6,-m) = 1 + m + m^2
%e A206710 Obviously when integer m > 1, Phi(3,m) < Phi(4,m) < Phi(6,m)
%e A206710 So a(3)=3, a(4)=4, and a(5)=6
%e A206710 For those k's that make A000010(k) = 4
%e A206710   Phi(5,-m) = 1 - m + m^2 - m^3 + m^4
%e A206710   Phi(8,-m) = 1 + m^4
%e A206710 Phi(10,-m) = 1 + m + m^2 + m^3 + m^4
%e A206710 Phi(12,-m) = 1 - m^2 + m^4
%e A206710 Obviously when integer m > 1, Phi(5,m) < Phi(12,m) < Phi(8,m) < Phi(10,m),
%e A206710 So a(6) = 5, a(7) = 12, a(8) = 8, and a(9) = 10.
%e A206710 The table starts
%e A206710 1,2;
%e A206710 3,4,6;
%e A206710 5,12,8,10;
%t A206710 t = Select[Range[400], EulerPhi[#] <= 40 &]; SortBy[t, Cyclotomic[#, -2] &]
%Y A206710 Cf. A206292, A194712, A206225, A000010, A032447.
%K A206710 nonn,tabf
%O A206710 1,2
%A A206710 _Lei Zhou_, Feb 13 2012