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!)
A080046 Multiplicative Pascal triangle, read by rows: T(n,1)=T(n,n)=n and T(n,k) = T(n-1,k-1) * T(n-1,k). 6

%I #18 Dec 15 2015 00:58:09

%S 1,2,2,3,4,3,4,12,12,4,5,48,144,48,5,6,240,6912,6912,240,6,7,1440,

%T 1658880,47775744,1658880,1440,7,8,10080,2388787200,79254226206720,

%U 79254226206720,2388787200,10080,8,9,80640,24078974976000

%N Multiplicative Pascal triangle, read by rows: T(n,1)=T(n,n)=n and T(n,k) = T(n-1,k-1) * T(n-1,k).

%C T(n,2) = A052849(n) for n>1.

%H Reinhard Zumkeller and Andre F. Labossiere, <a href="/A080046/b080046.txt">Rows n=1..14 of triangle, flattened</a>

%H <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>

%e 1

%e 2 2

%e 3 4 3

%e 4 12 12 4

%o (Haskell)

%o a080046 n k = a080046_tabl !! (n-1) !! (k-1)

%o a080046_row n = a080046_tabl !! (n-1)

%o a080046_tabl = iterate f [1] where

%o f (x:xs) = [x + 1] ++ (zipWith (*) xs $ reverse xs) ++ [x + 1]

%o -- _Reinhard Zumkeller_, Oct 27 2013

%Y Cf. A007318, A082611.

%Y Cf. A051597.

%K nonn,tabl,look

%O 1,2

%A _Reinhard Zumkeller_, Jan 21 2003

%E Corrected by _André F. Labossière_, Sep 27 2004

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 March 28 12:26 EDT 2024. Contains 371254 sequences. (Running on oeis4.)