Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051742
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051742 Associated with a chi-inequality greedy algorithm. +0
2
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; listen)
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 this_sequence A134119 A064661 A131996

Adjacent sequences: A051739 A051740 A051741 this_sequence A051743 A051744 A051745

KEYWORD

nonn

AUTHOR

S. R. Finch (Steven.Finch(AT)inria.fr), Dec 07 1999

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research