Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091746
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091746 Generalized Stirling2 array (6,2). +0
14
1, 30, 12, 1, 2700, 1920, 426, 36, 1, 491400, 478800, 162540, 25344, 1956, 72, 1, 150368400, 181440000, 80451000, 17624880, 2130660, 147840, 5820, 120, 1, 69470200800, 98424849600, 52905560400, 14618016000, 2346624000, 232202880 (list; graph; listen)
OFFSET

1,2

COMMENT

The sequence of row lengths for this array is [1,3,5,7,9,11,...]=A005408(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

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

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

CROSSREFS

Cf. A078740 (3, 2)-Stirling2, A090438 (4, 2)-Stirling2, A091534 (5, 2)-Stirling2.

Cf. A091544 (first column), A091550 (second column divided by 12).

Cf. A091748 (row sums), A091750 (alternating row sums).

Sequence in context: A073401 A040875 A131773 this_sequence A040874 A147454 A147077

Adjacent sequences: A091743 A091744 A091745 this_sequence A091747 A091748 A091749

KEYWORD

nonn,easy,tabf

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Feb 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research