Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103917
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103917 Column k=3 sequence (without zero entries) of table A060524. +0
1
1, 30, 1519, 122156, 14466221, 2379402090, 519987386619, 145897455555864, 51151581893323161, 21923440338694533750, 11281206541276562523975, 6864911325693596764930500, 4877239291150357692189181125 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n)= sum over all multinomials M2(2*n+3,k), k from {1..p(2*n+3)} restricted to partitions with exactly three odd and any nonnegative number of even parts. p(2*n+3)= A000041(2*n+3) (partition numbers) and for the M2-multinomial numbers in A-St order see A036039(2*n,k). W. Lang, Aug 07 2007.

FORMULA

E.g.f. (with alternating zeros): A(x)=diff(a(x), x$3) with a(x):=(1/(sqrt(1-x^2))*(ln(sqrt((1+x)/(1-x))))^3)/3!.

EXAMPLE

Multinomial representation for a(2): partitions of 2*2+3=7 with three odd parts: (1^2,5) with A-St position k=5; (1,3^2) with k=7; (1^3,4) with k=9; (1^2,2,3) with k=10 and (1^3,2^2) with k=13. The M2 numbers for these partitions are 504, 280, 210, 420, 105 adding up to 1519 = a(2).

CROSSREFS

Sequence in context: A048536 A000173 A055351 this_sequence A089550 A007804 A108298

Adjacent sequences: A103914 A103915 A103916 this_sequence A103918 A103919 A103920

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Feb 24 2005

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research