Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097080
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097080 Array T(n,k) = number of partitions of n into distinct odd parts in which k is the greatest part, for k=1,2,...,n, n>=1. +0
1
1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0 (list; table; graph; listen)
OFFSET

1,1

COMMENT

First T(n,k) not 0 or 1 is T(17,9)=2, which counts 1+7+9 and 3+5+9. Row sums: A000700.

FORMULA

T(n, 1)=0 for all n; T(n, n)=1 for all odd n>1; and for n>=3, T(n, k)=0 if k is even, else T(n, k)=Sum{T(n-k, i): i=1, 2, ..., n-1} for k=2, 3, ..., n-1.

EXAMPLE

First 5 rows:

1

0 0

0 0 1

0 0 1 0

0 0 0 0 1

Row 40 with even-numbered terms deleted:

0 0 0 0 0 0 2 5 6 7 6 5 4 3 2 1 1 1 1;

e.g., final 2 counts these two partitions:

9+31 and 1+3+5+31.

CROSSREFS

Cf. A000700.

Sequence in context: A014359 A079998 A027356 this_sequence A011746 A123192 A089510

Adjacent sequences: A097077 A097078 A097079 this_sequence A097081 A097082 A097083

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Jul 23 2004

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research