Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112508
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112508 Counts the objects described in A047969 and A089246 when grouped by minimum part. (Row sums give A047970). +0
2
1, 1, 1, 1, 1, 3, 1, 1, 3, 9, 1, 1, 3, 9, 29, 1, 1, 3, 9, 29, 101 (list; graph; listen)
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: A132740 A106621 A011085 this_sequence A088749 A024737 A024958

Adjacent sequences: A112505 A112506 A112507 this_sequence A112509 A112510 A112511

KEYWORD

easy,nonn

AUTHOR

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

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 December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research