A036779 Greedy sequence such that no term is the average of three others.

0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 48, 49, 50, 51, 52, 60, 61, 62, 63, 64, 192, 193, 194, 195, 196, 204, 205, 206, 207, 208, 240, 241, 242, 243, 244, 252, 253, 254, 255, 256, 768, 769, 770, 771, 772, 780, 781, 782, 783, 784, 816, 817, 818, 819, 820, 828, 829

Offset

1,3

References

Related to R. K. Guy, Unsolved Problems Number Theory, C16.

Links

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

J. W. Layman, Some Properties of a Certain Nonaveraging Sequence, J. Integer Sequences, Vol. 2, 1999, #4.

A. M. Odlyzko and R. P. Stanley, Some curious sequences constructed with the greedy algorithm, 1978.

Mathematica

Flatten[Outer[Plus, 4 FromDigits[#, 4] & /@ Tuples[{0, 3}, 5], Range[0, 4]]] (* Birkas Gyorgy, May 27 2011 *)

Crossrefs

Sequence in context: A013620 A317498 A119799 * A037339 A285618 A062946

Adjacent sequences: A036776 A036777 A036778 * A036780 A036781 A036782

Keyword

nonn

Author

John W. Layman

Status

approved