Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059777
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059777 Number of self-conjugate three-quadrant Ferrers graphs that partition n. +0
4
1, 0, 1, 1, 2, 2, 3, 4, 6, 7, 9, 12, 16, 19, 24, 31, 39, 47, 58, 72, 89, 107, 129, 158, 192, 228, 273, 329, 393, 465, 551, 655, 776, 911, 1070, 1261, 1480, 1726, 2014, 2354, 2742, 3180, 3688, 4279, 4954, 5716, 6590, 7603, 8754, 10049, 11532 (list; graph; listen)
OFFSET

0,5

REFERENCES

G. E. Andrews, Three-quadrant Ferrers graphs, Indian J. Math., 42 (No. 1, 2000), 1-7.

FORMULA

G.f.: 1/(1+x)*1/Sum_{k>0} (-x)^(k*(k+1)/2). a(n)=1/n*Sum_{k=1..n} (-1)^(k+1)*(A002129(k)-1)*a(n-k). A006950(n) = a(n-1)+a(n), n>0. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 22 2002

MAPLE

mul((1+q^(2*n+3))/(1-q^(2*n+2)), n=0..101); # g.f.

CROSSREFS

Cf. A059776, A059778.

Sequence in context: A039908 A093950 A023894 this_sequence A017830 A026928 A102464

Adjacent sequences: A059774 A059775 A059776 this_sequence A059778 A059779 A059780

KEYWORD

nonn

AUTHOR

njas, Feb 21 2001

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research