|
|
A333975
|
|
a(1) = 1, a(2) = 2 and for n > 2, a(n) is the smallest number not of the form OR(a(i),a(j)) for 1 <= i < j < n.
|
|
1
|
|
|
1, 2, 4, 7, 8, 11, 13, 14, 16, 19, 21, 22, 25, 26, 28, 32, 35, 37, 38, 41, 42, 44, 49, 50, 52, 56, 64, 67, 69, 70, 73, 74, 76, 81, 82, 84, 88, 97, 98, 100
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
a[1] = 1; a[2] = 2;
a[n_] := a[n] =
For[k = a[n - 1] + 1, True, k++,
If[FreeQ[
Table[BitOr[a[i], a[j]], {i, 1, n - 2}, {j, i + 1, n - 1}], k],
Return[k]]];
|
|
PROG
|
(Python)
A333975_list, aset, m = [1, 2], set(), 2
for i in range(3, 10001):
for j in range(i-2):
m += 1
while m in aset:
m += 1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|