Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124975
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124975 Table (read by antidiagonals): t(1,n) = t(m,1) = 1 for all m and n. t(m,n) = (product{k=1 to m-1} t(k,n)) + (product{k=1 to n-1} t(m,k)). +0
3
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 7, 6, 7, 1, 1, 43, 25, 25, 43, 1, 1, 1807, 493, 350, 493, 1807, 1, 1, 3263443, 223657, 82449, 82449, 223657, 3263443, 1, 1, 10650056950807, 49621568893, 5454149449, 3495672702, 5454149449, 49621568893 (list; table; graph; listen)
OFFSET

1,5

EXAMPLE

t(3,4) = t(1,4)*t(2,4) + t(3,1)*t(3,2)*t(3,3) = 1*7 + 1*3*6 = 25.

MATHEMATICA

t[m_, n_] := t[m, n] = If[m == 1 || n == 1, 1, Product[t[k, n], {k, m - 1}] + Product[t[m, j], {j, n - 1}]]; Flatten@Table[t[d + 1 - j, j], {d, 9}, {j, d}] (*Chandler*)

CROSSREFS

Cf. A124976.

Adjacent sequences: A124972 A124973 A124974 this_sequence A124976 A124977 A124978

Sequence in context: A090011 A061554 A088326 this_sequence A129439 A129453 A129455

KEYWORD

easy,nonn,tabl

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Nov 14 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 19 2006

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 May 22 15:55 EDT 2008. Contains 140006 sequences.


AT&T Labs Research