|
Search: id:A079358
|
|
|
| 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.". |
|
+0
2
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A generalization of A079000 that, like A079000 itself, is based on a class of numbers comprising exactly one-half of the integers.
|
|
LINKS
|
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: A005839 A062102 A092289 this_sequence A066344 A059549 A155902
Adjacent sequences: A079355 A079356 A079357 this_sequence A079359 A079360 A079361
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Matthew Vandermast (ghodges14(AT)comcast.net), Feb 14 2003
|
|
|
Search completed in 0.002 seconds
|
