login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126683 a(n) is the number of partitions of the n-th triangular number n(n+1)/2 into distinct odd parts. 0
1, 1, 1, 2, 4, 8, 16, 33, 68, 144, 312, 686, 1523, 3405, 7652, 17284, 39246, 89552, 205253, 472297, 1090544, 2525904, 5867037, 13663248, 31896309, 74628130, 174972341, 411032475, 967307190, 2280248312, 5383723722, 12729879673 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

Also the number of self-conjugate partitions of the n-th triangular number.

EXAMPLE

The 5th triangular number is 15. Writing this as a sum of distinct odd numbers: 15 = 11 + 3 + 1 = 9 + 5 + 1 = 7 + 5 + 3 are all the possibilities. So a(5) = 4.

MAPLE

g:=product(1+x^(2*j+1), j=0..900): seq(coeff(g, x, n*(n+1)/2), n=1..40); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 27 2007

CROSSREFS

Sequences A066655 and A104383 do the same thing for triangular numbers, with partitions or distinct partitions. Sequences A072213 and A072243 are analogues for squares rather than triangular numbers.

Sequence in context: A119610 A121485 A098588 * A005821 A177794 A004149

Adjacent sequences:  A126680 A126681 A126682 * A126684 A126685 A126686

KEYWORD

nonn

AUTHOR

Moshe Newman (mshnoiman(AT)hotmail.com), Feb 15 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 27 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 03:44 EST 2012. Contains 205860 sequences.