A079358 a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is not a multiple of either 3 or 4.".

1, 2, 4, 5, 7, 8, 10, 11, 12, 13, 14, 17, 19, 22, 24, 27, 29, 30, 31, 32, 33, 34, 36, 37, 39, 40, 41, 42, 43, 46, 47, 49, 50, 53, 54, 55, 58, 60, 61, 62, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 82, 84, 87, 89, 90, 91, 94, 95, 96, 99, 101, 103, 106, 107, 109

Offset

1,2

Comments

A generalization of A079000 that, like A079000 itself, is based on a class of numbers comprising exactly one-half of the integers.

Links

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

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)

Example

a(3) cannot be 3 because that would imply that the third term is not a multiple of 3. 4 is the smallest possible value for a(3) that creates no contradiction; therefore a(3)=4 and the fourth term is the next member of the sequence that is not a multiple of 3 or 4.

Crossrefs

Cf. A079000.

Sequence in context: A254792 A062102 A092289 * A184014 A183856 A183869

Adjacent sequences: A079355 A079356 A079357 * A079359 A079360 A079361

Keyword

easy,nonn

Author

Matthew Vandermast, Feb 14 2003

Status

approved