Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104382
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104382 Triangle, read by rows, where T(n,k) equals number of distinct partitions of triangular number n*(n+1)/2 into k different summands for n>=k>=1. +0
5
1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 7, 12, 6, 1, 1, 10, 27, 27, 10, 1, 1, 13, 52, 84, 57, 14, 1, 1, 17, 91, 206, 221, 110, 21, 1, 1, 22, 147, 441, 674, 532, 201, 29, 1, 1, 27, 225, 864, 1747, 1945, 1175, 352, 41, 1, 1, 32, 331, 1575, 4033, 5942, 5102, 2462, 598, 55, 1, 1, 38, 469 (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 20 16:13 EST 2009. Contains 171081 sequences.


AT&T Labs Research