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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096772 A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct. 0
1, 2, 5, 14, 33, 72, 125, 219, 376, 573, 745, 1209, 1557, 2442, 3098, 4048, 5298, 6704, 7839, 10987, 12332, 15465, 19144, 24546, 28974, 34406, 37769, 45864, 50877, 61372, 68303, 77918, 88545, 101917, 122032, 131625, 148575, 171237, 197815, 201454 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

This is the B3-sequence analogue of the Mian-Chowla B2-sequence (A005282): Let a(1)=1; then use the greedy algorithm to choose the smallest a(n) > a(n-1) such that all sums a(i) + a(j) + a(k) are distinct for 1 <= i <= j <= k <= n. The reciprocal sum of the sequence for the first forty terms is 1.837412....

LINKS

Table of n, a(n) for n=1..40.

Eric Weisstein's World of Mathematics, B2-Sequence.

Eric Weisstein's World of Mathematics, Mian-Chowla Sequence.

CROSSREFS

Cf. A005282 (Mian-Chowla B2-sequence).

Sequence in context: A056358 A036681 A125615 * A090803 A018015 A080039

Adjacent sequences:  A096769 A096770 A096771 * A096773 A096774 A096775

KEYWORD

nonn

AUTHOR

Rick L. Shepherd, Aug 15 2004

STATUS

approved

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

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

Last modified September 1 09:51 EDT 2014. Contains 246289 sequences.