Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084950
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084950 A factorial triangle, with row sums = a(n) of A001040. +0
1
1, 1, 2, 1, 6, 4, 24, 18, 1, 120, 96, 9, 720, 600, 72, 1, 5040, 4320, 600, 16, 40320, 35280, 5400, 200, 1, 362880, 322560, 52920, 2400, 25, 3628800, 3265920, 564480, 29400, 450, 1 (list; graph; listen)
OFFSET

0,3

FORMULA

Given a flush left array, (r, c) of row (n+1) = (n+1)*(r-1, c) + (r-2, c-1); (i.e. multiply each term of n-th row by (n+1) and add the first term on the NW diagonal; getting the terms in row n+1.

EXAMPLE

By rows, the triangle is:

0. 1

1. 1

2. 2 1

3. 6 4

4. 24 18 1

5. 120 96 9

6. 720 600 72 1

7. 5040 4320 600 16

...

E.g. to get the terms of row 7, multiply each term of row 6 by 7, then add the term NW of term in row 6: 5040 = (7)(720); 4320 = (7)(600) + 20; 600 = (7)(72) + 96; 16 = (7)(1) + 9. Thus row 7 = 5040 4320 600 16 with a sum of 9976 = a(7) of A001040.

CROSSREFS

Cf. A001040.

Sequence in context: A121403 A005299 A128728 this_sequence A066654 A145960 A108767

Adjacent sequences: A084947 A084948 A084949 this_sequence A084951 A084952 A084953

KEYWORD

tabf,nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 14 2003

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 December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research