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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112508 Counts the objects described in A047969 and A089246 when grouped by minimum part. (Row sums give A047970). 1
1, 1, 1, 1, 1, 3, 1, 1, 3, 9, 1, 1, 3, 9, 29, 1, 1, 3, 9, 29, 101 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

EXAMPLE

Row 4 of the triangular array is (1 1 3 9) because there are nine tuples with a minimum value of 1, three tuples with a minimum value of 2, one tuple with a minimum value of 3 and one tuple with a minimum value of 4; the relevant unordered partitions are illustrated in the below Gaussian polynomial template:

4

31 32 33

211 221 222

1111

CROSSREFS

Cf. A047969, A089246.

Sequence in context: A106621 A011085 A199922 * A088749 A024737 A024958

Adjacent sequences:  A112505 A112506 A112507 * A112509 A112510 A112511

KEYWORD

easy,nonn

AUTHOR

Alford Arnold (Alford1940(AT)aol.com), Sep 08 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 21:55 EST 2012. Contains 205561 sequences.