login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A199769 Number of brackets in distinct sets with fewest possible elements 0
1, 2, 3, 4, 4, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..104.

FORMULA

a(n) = A198759(n+1) - A198759(n)

EXAMPLE

There are three repetitions of 5 because of the sets {{{{{}}}}}, {{{}, {{}}}}, and {{{{}}}, {}}.

CROSSREFS

Differences of A198759.  Also n repeated A004111(n) times.

Sequence in context: A034586 A268383 A092338 * A030601 A049839 A130233

Adjacent sequences:  A199766 A199767 A199768 * A199770 A199771 A199772

KEYWORD

nonn

AUTHOR

Joshua Zucker, Nov 10 2011

EXTENSIONS

Second set in example corrected by Rick L. Shepherd, May 22 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 20 12:13 EST 2019. Contains 329335 sequences. (Running on oeis4.)