login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112492 Triangle from inverse scaled Pochhammer symbols. 10
1, 1, 1, 1, 3, 1, 1, 7, 11, 1, 1, 15, 85, 50, 1, 1, 31, 575, 1660, 274, 1, 1, 63, 3661, 46760, 48076, 1764, 1, 1, 127, 22631, 1217776, 6998824, 1942416, 13068, 1, 1, 255, 137845, 30480800, 929081776, 1744835904, 104587344, 109584, 1, 1, 511, 833375 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

This expansion is based on the partial fraction identity: 1/product(x+j,j=1..m)= (1 + sum(((-1)^j)*binomial(m,j)*x/(x+j),j=1..m))/m!, e.g., p. 37 of the Ch. Jordan reference.

Another version of this triangle (without a column of 1's) is A008969.

The column sequences are, for m=1..10: A000012 (powers of 1), A000225, A001240, A001241, A001242, A111886-A111888.

From Gottfried Helms, Dec 11 2001. (Start)

The triangle occurs as U-factor in the LDU-decomposition of the matrix M defined by m(r,c)=1/(1+r)^c (r,c,beginning at 0).

Then

  a(r,c)= m(r,c) * (1+r)!^(c-r)

An explicite expansion based on this can be made by defining a "recursice harmonic number" (rhn). (This representation is just a heuristic pattern-interpretation, no analytic proof yet available).

Consider

  h(k,0)=1      for k>0      as rhn of order zero(0).

Then consider

  h(1,1)=1*h(1,0)

  h(2,1)=1*h(1,0) + 1/2*h(2,0)

  h(3,1)=1*h(1,0) + 1/2*h(2,0) + 1/3*h(3,0) = h(2,1)+1/3*h(3,0)

  ...

and recursively

  h(1,r)=1*h(1,r-1)

  h(2,r)=1*h(1,r-1) + 1/2*h(2,r-1)

  h(3,r)=1*h(1,r-1) + 1/2*h(2,r-1) + 1/3*h(3,r-1) = h(2,r)+1/3*h(3,r-1)

  ...

  h(k,r)=h(k-1,r)+1/k*h(k,r-1)

then the upper triangular triangle A:=a(r,c) for c-r>0

a(r,c) = h(r,c-r) *(1+r)!^(c-r)

(End)

REFERENCES

Charles Jordan, Calculus of Finite Differences, Chelsea, 1965.

LINKS

W. Lang, First 10 rows.

FORMULA

G.f. for column m>=1: (x^m)/product(1-m!*x/j, j=1..m).

a(n, m)= -(m!^(n-m+1))*sum(((-1)^j)*binomial(m, j)/j^(n-m+1), j=1..m), m>=1. a(n, m)=0 if n+1<m.

PROG

(PARI): {h(n, recurse=1) = if(recurse == 0, return(1)); ;

return( sum(k=0, n, h(k, recurse-1) / (1+k) )); }

a(r, c) = h(r-1, c-r) * r!^(c-r) - Gottfried Helms, Dec 11 2001

CROSSREFS

Row sums give A111885.

Sequence in context: A176791 A075440 A137470 * A049290 A147990 A134567

Adjacent sequences:  A112489 A112490 A112491 * A112493 A112494 A112495

KEYWORD

nonn,easy,tabl

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Sep 12 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 09:15 EST 2012. Contains 205753 sequences.