login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A224531 Triangle in which row n > 1 has the n values x such that phi(x) = A007374(n), We define the first row to be 0. 3

%I #7 Oct 01 2015 11:52:50

%S 0,1,2,3,4,6,5,8,10,12,15,16,20,24,30,13,21,26,28,36,42,51,64,68,80,

%T 96,102,120,37,57,63,74,76,108,114,126,41,55,75,82,88,100,110,132,150,

%U 35,39,45,52,56,70,72,78,84,90,65,104,105,112,130,140,144,156,168,180,210

%N Triangle in which row n > 1 has the n values x such that phi(x) = A007374(n), We define the first row to be 0.

%H T. D. Noe, <a href="/A224531/b224531.txt">Rows n = 1..100 of triangle, flattened</a>

%H D. Bressoud, <a href="http://www.macalester.edu/~bressoud/books/CNT.m">CNT.m</a> Computational Number Theory Mathematica package.

%e Triangle:

%e 0,

%e 1, 2,

%e 3, 4, 6,

%e 5, 8, 10, 12,

%e 15, 16, 20, 24, 30,

%e 13, 21, 26, 28, 36, 42,

%e 51, 64, 68, 80, 96, 102, 120,

%e 37, 57, 63, 74, 76, 108, 114, 126,

%e 41, 55, 75, 82, 88, 100, 110, 132, 150

%t Needs["CNT`"]; nn = 10; t = Table[{}, {nn}]; n = 0; t[[1]] = {0}; left = nn - 1; While[left > 0, n++; p = PhiInverse[n]; cnt = Length[p]; If[cnt <= nn && t[[cnt]] == {}, t[[cnt]] = p; left--]]; t

%Y Cf. A066420, A224532 (numbers in the first column and diagonal).

%K nonn,tabl

%O 1,3

%A _T. D. Noe_, Apr 11 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)