cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A338452 Numbers k such that k and k+1 have the same total binary weight of their divisors (A093653).

This page as a plain text file.
%I A338452 #12 Oct 31 2020 02:53:37
%S A338452 3,4,7,20,31,57,94,98,118,122,127,201,213,218,230,242,243,244,334,384,
%T A338452 393,423,429,481,565,603,633,694,704,729,766,844,921,1138,1141,1221,
%U A338452 1262,1401,1533,1654,1726,1761,1837,1838,1862,1882,1942,2162,2245,2361,2362
%N A338452 Numbers k such that k and k+1 have the same total binary weight of their divisors (A093653).
%C A338452 Numbers k such that A093653(k) = A093653(k+1).
%C A338452 The Mersenne primes (A000668) are terms since if 2^p - 1 is a prime then A093653(2^p-1) = A093653(2^p) = p+1.
%H A338452 Amiram Eldar, <a href="/A338452/b338452.txt">Table of n, a(n) for n = 1..10000</a>
%e A338452 3 is a term since A093653(3) = A093653(4) = 3.
%t A338452 f[n_] := DivisorSum[n, DigitCount[#, 2, 1] &]; s = {}; f1 = f[1]; Do[f2 = f[n]; If[f1 == f2, AppendTo[s, n - 1]]; f1 = f2, {n, 2, 240}]; s
%Y A338452 Cf. A000120, A093653.
%Y A338452 A000668 is a subsequence.
%Y A338452 Similar sequences: A002961, A005237, A054004, A064125, A238380, A293183, A306985.
%K A338452 nonn,base
%O A338452 1,1
%A A338452 _Amiram Eldar_, Oct 28 2020