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!)
A074912 Triangle generated by Pascal's rule, except begin and end the n-th row with phi(n). 1

%I #13 Nov 13 2014 15:29:10

%S 1,1,1,2,2,2,2,4,4,2,4,6,8,6,4,2,10,14,14,10,2,6,12,24,28,24,12,6,4,

%T 18,36,52,52,36,18,4,6,22,54,88,104,88,54,22,6,4,28,76,142,192,192,

%U 142,76,28,4,10,32,104,218,334,384,334,218,104,32,10

%N Triangle generated by Pascal's rule, except begin and end the n-th row with phi(n).

%e 1;

%e 1,1;

%e 2,2,2;

%e 2,4,4,2;

%e 4,6,8,6,4;

%e 2,10,14,14,10,2;

%e 6,12,24,28,24,12,6;

%e 4,18,36,52,52,36,18,4;

%e 6,22,54,88,104,88,54,22,6;

%e 4,28,76,142,192,192,142,76,28,4;

%p A074912 := proc(n,k) if k=1 or k=n then numtheory[phi](n); elif k > n or k < 1 then 0; else procname(n-1,k-1)+procname(n-1,k) ; end if; end proc: seq(seq(A074912(n, k), k=1..n), n=1..12); # _R. J. Mathar_, Aug 24 2011

%o (PARI) t(n, k) = {if ((k<1) || (k>n), return (0)); if ((k==1) || (k==n), return (eulerphi(n))); return (t(n-1, k-1)+t(n-1, k));}

%o tabl(nn) = {for (n=1, nn, for (k=1, n, print1(t(n,k), ", ");); /* print();*/);} \\ _Michel Marcus_, Nov 13 2014

%K easy,nonn,tabl

%O 1,4

%A _Joseph L. Pe_, Oct 01 2002

%E More terms from _Michel Marcus_, Nov 13 2014

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 18 15:48 EDT 2024. Contains 371780 sequences. (Running on oeis4.)