OFFSET
1,2
COMMENTS
Could be rearranged as a triangle of numbers in which i-th row is {7^(i-j)*8^j, 0<=j<=i}; i >= 0. (This would produce a different sequence, of course).
The sum of the reciprocals of the terms of this sequence is equal to 4/3. Brief proof: as gcd(7, 8) = 1, 1 + 1/7 + 1/8 + 1/49 + 1/56 + 1/64 + 1/343 + ... = (Sum_{k>=0} 1/7^k) * (Sum_{m>=0} 1/8^m) = (1/(1-1/7)) * (1/(1-1/8)) = (7/(7-1)) * (8/(8-1)) = 4/3. - Bernard Schott, Oct 24 2019
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Robert Sedgewick, Analysis of shellsort and related algorithms, Fourth European Symposium on Algorithms, Barcelona, September, 1996.
FORMULA
a(n) ~ exp(sqrt(2*log(7)*log(8)*n)) / sqrt(56). - Vaclav Kotesovec, Sep 25 2020
MAPLE
N:= 10^7: # for all terms <= N
sort([seq(seq(7^i*8^j, j=0..floor(log[8](N/7^i))), i=0..floor(log[7](N)))]); # Robert Israel, Oct 24 2019
MATHEMATICA
n = 10^6; Flatten[Table[7^i*8^j, {i, 0, Log[7, n]}, {j, 0, Log[8, n/7^i]}]] // Sort (* Amiram Eldar, Sep 26 2020 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
STATUS
approved