Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032265
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032265 Number of ways to partition n labeled elements into pie slices of at least 2 elements allowing the pie to be turned over. +0
1
0, 1, 1, 4, 11, 41, 162, 925, 5945, 47017, 402788, 3895937, 40556595, 461544253, 5625446270, 73716523405, 1028179882589, 15257484239777, 239529471989352, 3971376169852777, 69288230115817655 (list; graph; listen)
OFFSET

1,4

LINKS

C. G. Bower, Transforms (2)

FORMULA

"DIJ" (bracelet, indistinct, labeled) transform of 0, 1, 1, 1...

CROSSREFS

Sequence in context: A149269 A149270 A000296 this_sequence A151273 A149271 A149272

Adjacent sequences: A032262 A032263 A032264 this_sequence A032266 A032267 A032268

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net)

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research