Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156224
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156224 Triangle read by rows:t(n,m)=(Binomial[n, m]*PartitionsQ[n] + Binomial[n, n - m]*(PartitionsQ[ n - m] + PartitionsQ[m])) - 2. +0
1
1, 1, 1, 1, 4, 1, 3, 10, 10, 3, 3, 18, 22, 18, 3, 5, 28, 58, 58, 28, 5, 7, 46, 103, 158, 103, 46, 7, 9, 68, 187, 313, 313, 187, 68, 9, 11, 94, 306, 614, 698, 614, 306, 94, 11, 15, 133, 502, 1174, 1636, 1636, 1174, 502, 133, 15, 19, 188, 763, 2038, 3358, 4030, 3358, 2038, 763 (list; table; graph; listen)
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 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research