login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089517 Array used for numerators of g.f.s for column sequences of array A078741 ((3,3)-Stirling2). 4
1, 18, 9, 432, 1, 672, 14400, 243, 47520, 648000, 27, 36396, 3790800, 38102400, 1, 9765, 5115888, 354715200, 2844979200, 1107, 2499552, 757646784, 39182330880, 263363788800, 54, 546453, 592216272, 123294623040, 5089348454400 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,2
COMMENTS
The row length sequence for this array is A004396(n-2)=floor((2*n-3)/3), n>=3: [1,1,2,3,3,4,5,5,6,7,7,8,9,9,10,...].
The g.f. G(m,x) for the m-th column sequence (with leading zeros) of array A078741 is given there. The recurrence is G(m,x) = x*(3*fallfac(m-1,2)*G(m-1,x) + 3*(m-2)*G(m-2,x) + G(m-3,x))/(1-fallfac(m,3)*x), m>=4, with inputs G(1,x)=0=G(2,x) and G(3,x)=x/(1-(3*2*1)*x); where fallfac(n,m) := A008279(n,m) (falling factorials). Computed from the Blasiak et al. reference, eqs. (20) and (21) with r=3: recurrence for S_{3,3}(n,k).
LINKS
W. Lang, First 11 rows.
FORMULA
a(n, m) from: sum(a(n, m)*x^m, m=0..kmax(n)) = G(n, x)* product(1-fallfac(p, 3)*x, p=3..n)/x^ceiling(n/3), n>=3, with G(n, x) defined from the recurrence given above and kmax(n) := A004523(n-3)= floor(2*(n-3)/3) = A004396(n-3)-1.
EXAMPLE
[1]; [18]; [9,423]; [1,672,14400]; [243,47520,648000]; ...
G(4,x)/(x^2) = 18/((1-3*2*1*x)*(1-4*3*2*x)). kmax(4)=0, hence P(4,x)=a(4,0)=18; x^2 from x^ceiling(4/3).
CROSSREFS
Sequence in context: A147438 A033965 A146415 * A290345 A035616 A355238
KEYWORD
nonn,easy,tabf
AUTHOR
Wolfdieter Lang, Dec 01 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 17:49 EDT 2024. Contains 371797 sequences. (Running on oeis4.)