Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090440
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090440 Generalized Stirling2 array (4,3). +0
3
1, 24, 36, 12, 1, 1440, 5760, 6120, 2520, 456, 36, 1, 172800, 1339200, 2808000, 2420640, 1025280, 232920, 29400, 2040, 72, 1, 36288000, 471744000, 1643846400, 2381702400, 1745755200, 721224000, 178941600, 27624960, 2689920, 163800, 6000 (list; graph; listen)
OFFSET

1,2

COMMENT

The row lengths for this array are [1,4,7,10,13,16,...] = A016777(n-1), n>=1.

REFERENCES

P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, Phys. Lett. A 309 (2003) 198-205.

M. Schork, On the combinatorics of normal ordering bosonic operators and deforming it, J. Phys. A 36 (2003) 4651-4665.

LINKS

W. Lang, First 6 rows.

FORMULA

Recursion: a(n, k)=sum(binomial(3, p)*fallfac(n-1-p+k, 3-p)*a(n-1, k-p), p=0..3), n>=2, 3<=k<=3*n, a(1, 3)=1, else 0. Rewritten from eq.(19) of the Schork reference with r=4, s=3. fallfac(n, m) := A008279(n, m) (falling factorials triangle).

a(n, k)=(((-1)^k)/k!)*sum(((-1)^p)*binomial(k, p)*product(fallfac(p+j-1, 3), j=1..n), p=3..k), n>=1, 3<=k<=3*n, else 0. From eq. (12) of the Blasiak et al. reference with r=4, s=3.

CROSSREFS

Cf. A090438 (4, 2)-Stirling2.

Cf. A070531 (row sums), A091028 (alternating row sums).

Sequence in context: A025102 A102505 A112064 this_sequence A091192 A067807 A067341

Adjacent sequences: A090437 A090438 A090439 this_sequence A090441 A090442 A090443

KEYWORD

nonn,easy,tabf

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Dec 23 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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research