Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080046
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
4
1, 2, 2, 3, 4, 3, 4, 12, 12, 4, 5, 48, 144, 48, 5, 6, 240, 6912, 6912, 240, 6, 7, 1440, 1658880, 47775744, 1658880, 1440, 7, 8, 10080, 2388787200, 79254226206720, 79254226206720, 2388787200, 10080, 8, 9, 80640, 24078974976000 (list; table; graph; listen)
OFFSET

1,2

COMMENT

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

LINKS

Reinhard Zumkeller and Andre F. Labossiere, Table of n, a(n) for n = 1..58

EXAMPLE

1

2 2

3 4 3

4 12 12 4

CROSSREFS

Cf. A007318, A082611.

Sequence in context: A084192 A129595 A094508 this_sequence A047675 A026254 A091525

Adjacent sequences: A080043 A080044 A080045 this_sequence A080047 A080048 A080049

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 21 2003

EXTENSIONS

Corrected by Andre F. Labossiere (boronali(AT)laposte.net), Sep 27 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research