[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A293198
a(n) is the least positive k such that f(k) = f(k + n) where f(k) = A000120(k) / A070939(k).
2
1, 5, 1, 9, 3, 21, 1, 2, 2, 19, 2, 38, 3, 37, 1, 33, 15, 35, 38, 37, 84, 35, 76, 12, 7, 10, 9, 10, 3, 4, 1, 10, 4, 2, 5, 2, 2, 6, 5, 2, 2, 5, 2, 9, 4, 6, 5, 2, 2, 5, 2, 6, 5, 5, 2, 5, 7, 137, 138, 134, 3, 133, 1, 129, 63, 131, 134, 133, 140, 131, 138, 137, 152, 139, 134, 133, 148, 131, 146, 56, 336, 135, 150, 52
OFFSET
0,2
COMMENTS
Numbers m such that a(2^m*(2^(m + 1) - 1) + 1) = 2^m are 0, 1, 2, 3, 4, 5, 6, 8, 9, 11, 14, 15, 18, 20, 21, ...
Numbers t such that a(t) = 2 are 7, 8, 10, 33, 35, 36, 39, 40, 42, 47, 48, 50, ...
Numbers t such that a(t) > t are 0, 1, 3, 5, 9, 11, 13, 15, 17, 18, 19, 20, 21, ...
FORMULA
a(n) <> n for all n >= 0.
a(n) <= 5*n for all n >= 1.
a(2^m - 1) = 1 for all m >= 1.
a(2^m - 2^2) = 2^2 - 1 for all m >= 3.
a(2^m - 2^3) = 2^3 - 1 for all m >= 5.
a(2^m - 2^4) = 2^4 - 1 for all m >= 7.
a(2^m - 2^5) = 2^5 - 1 for all m >= 10.
a(2^m - 2^6) = 2^6 - 1 for all m >= 13.
a(2^m - 2^7) = 2^7 - 1 for all m >= 17.
a(2^m - 2^8) = 2^8 - 1 for all m >= 21.
a(2^m - 2^9) = 2^9 - 1 for all m >= 26.
a(2^(p - 1)) = 2^(p - 1) - 1 and a(2^(p - 1) - 1) = 2^p + 1 for all primes p.
a(2^(p - 1) + 1) = 2^p + 3 for all primes p >= 5.
EXAMPLE
a(5) = 21 because 21 = 2^4 + 2^2 + 2^0, 21 + 5 = 2^4 + 2^3 + 2^1; A000120(21) / A070939(21) = A000120(21 + 5) / A070939(21 + 5) and 21 is the least number with this property.
PROG
(PARI) a(n) = {my(k=1); while (hammingweight(k+n)/#binary(k+n) != hammingweight(k) /#binary(k), k++); k; }
CROSSREFS
KEYWORD
nonn,base,look,easy
AUTHOR
Altug Alkan, Oct 05 2017
STATUS
approved