The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A110663 Triangle read by rows: T(n,k) = Sum_{j=k..n} phi(j) (1<=k<=n), where phi is Euler's totient function. 2

%I #17 Sep 03 2017 17:13:58

%S 1,2,1,4,3,2,6,5,4,2,10,9,8,6,4,12,11,10,8,6,2,18,17,16,14,12,8,6,22,

%T 21,20,18,16,12,10,4,28,27,26,24,22,18,16,10,6,32,31,30,28,26,22,20,

%U 14,10,4,42,41,40,38,36,32,30,24,20,14,10,46,45,44,42,40,36,34,28,24,18,14,4

%N Triangle read by rows: T(n,k) = Sum_{j=k..n} phi(j) (1<=k<=n), where phi is Euler's totient function.

%H Indranil Ghosh, <a href="/A110663/b110663.txt">Rows 1..100, flattened</a>

%F T(n,n) = phi(n) = A000010(n) = number of numbers <=n and relatively prime to n.

%F T(n,1) = Sum_{j=1..n} phi(j) = A002088(n).

%e T(5,3) = 8 because phi(3)+phi(4)+phi(5) = 2+2+4 = 8.

%e Triangle begins:

%e 1;

%e 2,1;

%e 4,3,2;

%e 6,5,4,2;

%e 10,9,8,6,4;

%e ...

%t T[n_, n_] := EulerPhi[n]; T[n_, k_] := Sum[EulerPhi[j], {j, k, n}];

%t Table[T[n, k], {n, 1, 10}, {k, 1, n}] // Flatten (* _G. C. Greubel_, Sep 03 2017 *)

%o (PARI) tabl(nn) = {for (n=1, nn, for (k=1, n, print1(sum(j=k, n, eulerphi(j)), ", ");); print(););} \\ _Michel Marcus_, Apr 05 2015

%Y Cf. A000010, A002088.

%K nonn,tabl

%O 1,2

%A _Emeric Deutsch_, Aug 02 2005

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 May 26 05:37 EDT 2024. Contains 372807 sequences. (Running on oeis4.)