Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027300
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027300 Triangular array Q given by rows: Q(n,k) = number of partitions of n that do not contain k as an element; domain: 1<=k<=n, n >= 1. +0
1
0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 2, 4, 5, 6, 6, 4, 6, 8, 9, 10, 10, 4, 8, 10, 12, 13, 14, 14, 7, 11, 15, 17, 19, 20, 21, 21, 8, 15, 19, 23, 25, 27, 28, 29, 29, 12, 20, 27, 31, 35, 37, 39, 40, 41, 41, 14, 26, 34, 41, 45, 49, 51, 53, 54, 55, 55, 21, 35 (list; table; graph; listen)
OFFSET

1,5

CROSSREFS

Q(n, k) = P(n+1, 1) - P(n, k), P given by A027299.

Sequence in context: A155162 A071454 A039642 this_sequence A085313 A065458 A144000

Adjacent sequences: A027297 A027298 A027299 this_sequence A027301 A027302 A027303

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research