|
|
A192110
|
|
Monotonic ordering of nonnegative differences 2^i - 3^j, for 40 >= i >= 0, j >= 0.
|
|
9
|
|
|
0, 1, 3, 5, 7, 13, 15, 23, 29, 31, 37, 47, 55, 61, 63, 101, 119, 125, 127, 175, 229, 247, 253, 255, 269, 295, 431, 485, 503, 509, 511, 781, 943, 997, 1015, 1021, 1023, 1319, 1631, 1805, 1909, 1967, 2021, 2039, 2045, 2047, 3367, 3853, 4015, 4069, 4087, 4093
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Warning: Note the definition assumes i <= 40.
Because of this assumption, it is not true that this is (except for a(1)=0) the complement of A075824 in the odd integers.
However, by definition, it is the complement of A328077.
(End)
All 52 sequences in this set are finite. - Georg Fischer, Nov 16 2021
|
|
LINKS
|
H. Gauchman and I. Rosenholtz (Proposers), R. Martin (Solver), Difference of prime powers, Problem 1404, Math. Mag., 65 (No. 4, 1992), 265; Solution, Math. Mag., 66 (No. 4, 1993), 269.
|
|
EXAMPLE
|
The differences accrue like this:
1-1
2-1
4-3.....4-1
8-3.....8-1
16-9....16-3....16-1
32-27...32-9....32-3....32-1
64-27...64-9....64-3....64-1
|
|
MATHEMATICA
|
c = 2; d = 3; t[i_, j_] := c^i - d^j;
u = Table[t[i, j], {i, 0, 40}, {j, 0, i*Log[d, c]}];
v = Union[Flatten[u ]]
|
|
CROSSREFS
|
This is the first of a set of 52 similar sequences:
|
|
KEYWORD
|
nonn,fini
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|