login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092032 Arises in partition theory. 0
1, 2, 3, 4, 4, 5, 6, 5, 6, 6, 7, 8, 6, 7, 7, 8, 8, 9, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The number of entries <= n gives A000041(n) (the partition numbers). The length of column n is also A000041(n).

LINKS

Table of n, a(n) for n=0..18.

EXAMPLE

Write 0..n as column indices. Under each column write a number for each word of length n+1 of nonisomorphic ballot sequences on 2..(n+1), where the number is n+the number of distinct elements of 2..(n+1). So;

0 1 2 3 4 5

1 2 3 4 5 6

... 4 5 6 7

..... 6 6 7

....... 7 8

....... 8 8

......... 9

......... 10

e.g. for n=5, consider 22222, 22223, 22233, 22234, 22334, 22345, 23456, giving 6,7,7,8,8,9,10.

The sequence reads the columns in turn.

CROSSREFS

Sequence in context: A270832 A257646 A051898 * A058222 A064064 A101504

Adjacent sequences:  A092029 A092030 A092031 * A092033 A092034 A092035

KEYWORD

hard,nonn,tabf

AUTHOR

Jon Perry, Mar 26 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 October 1 08:39 EDT 2020. Contains 337442 sequences. (Running on oeis4.)