Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036055
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036055 Number of cycles of the permutation created by length sorting on the partitions of n. +0
1
1, 2, 3, 4, 5, 6, 6, 5, 8, 7, 7, 8, 9, 9, 11, 10, 11, 11, 11, 11, 17, 14, 11, 13, 16, 11, 18, 17, 17, 13 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A036045-A036056.

Adjacent sequences: A036052 A036053 A036054 this_sequence A036056 A036057 A036058

Sequence in context: A002330 A091951 A063283 this_sequence A034151 A101272 A006160

KEYWORD

nonn,more

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

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 November 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research