Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027189
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027189 Number of partitions of n into an odd number of parts, the least being 3; also, a(n+3) = number of partitions of n into an even number of parts, each >=3. +0
1
0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 11, 12, 17, 19, 25, 29, 37, 43, 56, 64, 80, 94, 116, 135, 167, 194, 236, 276, 332, 387, 466, 541, 645, 752, 891, 1034, 1223, 1417, 1666, 1931, 2260, 2613, 3054, 3522, 4098, 4725, 5480 (list; graph; listen)
OFFSET

1,11

CROSSREFS

Sequence in context: A069910 A008484 A026797 this_sequence A140829 A116575 A090492

Adjacent sequences: A027186 A027187 A027188 this_sequence A027190 A027191 A027192

KEYWORD

nonn

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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research