id:A052146 - OEIS Search Results

Search: id:A052146

Displaying 1-1 of 1 results found.

page 1

floor((sqrt(1+8*n)-3)/2).

+0
2

0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11 (list; graph; listen)

	OFFSET	`1,6`
	REFERENCES	`R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 7.2(d).`
	CROSSREFS	`Sequence in context: A025423 A087233 A104147 this_sequence A097882 A108955 A108956` `Adjacent sequences: A052143 A052144 A052145 this_sequence A052147 A052148 A052149`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jan 23 2000`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research