Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103916
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103916 Column k=2 sequence (without zero entries) of table A060524. +0
1
1, 14, 439, 24940, 2250621, 296266266, 53624576979, 12780684581400, 3880806293223225, 1462807581365269350, 670261417348408188975, 366936357918296751120900, 236559234981486279096163125 (list; graph; listen)
OFFSET

0,2

COMMENT

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

FORMULA

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

EXAMPLE

Multinomial representation for a(2): partitions of 2*3=6 with two odd parts: (1,5) with A-St position k=2; (3^2) with k=4; (1^2,4) with k=5; (1,2,3) with k=6 and (1^2,2^2) with k=9. The M2 numbers for these partitions are 144, 40, 90, 120, 45, adding up to 439 = a(2).

CROSSREFS

Sequence in context: A041367 A041364 A033815 this_sequence A005790 A128051 A024299

Adjacent sequences: A103913 A103914 A103915 this_sequence A103917 A103918 A103919

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research