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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092284 Number of nonterminal symbols in a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols. 0
1, 3, 7, 11, 26, 42, 99, 107, 382, 428, 1156, 1223, 4525, 4903, 14811, 14827, 58022, 61236, 201420, 201611 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

P. R. J. Asveld, Generating all permutations by context-free grammars in Chomsky normal form, Theoretical Computer Science 354 (2006) 118-130.

FORMULA

a(n) = Sum_{k=1..n} t(n, k), where t(n, k) is the n-th row of the Pascal-like triangle of A090349.

EXAMPLE

a(4) = 4 + 6 + 0 + 1 = 11; cf. the example grammar of A090349.

CROSSREFS

Cf. A090349.

Sequence in context: A139814 A099902 A316962 * A024459 A001645 A103798

Adjacent sequences:  A092281 A092282 A092283 * A092285 A092286 A092287

KEYWORD

nonn,more

AUTHOR

Peter R. J. Asveld, Jan 30 2004

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 December 6 14:15 EST 2019. Contains 329806 sequences. (Running on oeis4.)