|
Search: id:A113821
|
|
|
| A113821 |
|
Triangle where a(1,1)=1; and the n terms of row n are the smallest positive integers not occurring earlier in the sequence such that, for any given m (1<=m<=n), a(n,m) and n have at least one 1-bit in the same position when they are written in binary. |
|
+0
6
|
|
| 1, 2, 3, 5, 6, 7, 4, 12, 13, 14, 9, 11, 15, 17, 19, 10, 18, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 8, 24, 40, 41, 42, 43, 44, 45, 33, 35, 37, 39, 46, 47, 49, 51, 53, 34, 38, 50, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 69, 70, 71, 72, 73, 36, 52, 68, 74, 75, 76, 77
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sequence is a permutation of the positive integers.
|
|
EXAMPLE
|
4 = 100 in binary. Among the positive integers not occurring among the first 3 rows of the sequence (4 = 100 in binary, 8 = 1000 in binary, 9 = 1001 in binary, etc...), [4,12,13,14] (which is [100,1100,1101,1110] in binary) are the lowest 4 positive integers that share at least one 1-bit with 4 when written in binary. So row 4 is
[4,12,13,14].
|
|
CROSSREFS
|
Cf. A115630 (inverse), A115640 (fixed points), A115641 (cycles), A115642 (cycle lengths).
Sequence in context: A023834 A084735 A002734 this_sequence A019517 A031976 A023839
Adjacent sequences: A113818 A113819 A113820 this_sequence A113822 A113823 A113824
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jan 23 2006
|
|
EXTENSIONS
|
More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jan 29 2006
|
|
|
Search completed in 0.002 seconds
|
