A051742 - OEIS

This site is supported by donations to The OEIS Foundation.

A051742

Associated with a chi-inequality greedy algorithm.

1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	REFERENCES	`S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 163-166.`
	LINKS	`S. R. Finch, A convex maximization problem: Discrete case` `S. R. Finch, A Convex Maximization Problem` `S. R. Finch, Erdos's Reciprocal Sum Constants`
	CROSSREFS	`Cf. A014011.` `Sequence in context: A137588 A033271 A004052 * A134119 A064661 A131996` `Adjacent sequences: A051739 A051740 A051741 * A051743 A051744 A051745`
	KEYWORD	`nonn`
	AUTHOR	`S. R. Finch (Steven.Finch(AT)inria.fr), Dec 07 1999`

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

Last modified February 15 17:43 EST 2012. Contains 205830 sequences.