Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A160181
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A160181 a(n) is the total number of partitions of sets containing from 0 to n elements into blocks of at least 2 elements. It is the sum of the first n+1 terms of A000296. +0
1
1, 1, 2, 3, 7, 18, 59, 221, 936, 4361, 22083, 120336, 700653, 4333933, 28345090, 195233255, 1411303635, 10675375402, 84276173439, 692752181561, 5917018378496, 52416910416933, 480786834535250, 4559132648864259 (list; graph; listen)
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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research