login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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. 1
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 analog 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.

FORMULA

a(n) = A051912(n-1) + 1. - Peter Kagey, Oct 20 2021

CROSSREFS

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

Sequence in context: A296502 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 | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 30 07:06 EST 2023. Contains 359939 sequences. (Running on oeis4.)