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.

A385487 Records in A385485.

This page as a plain text file.
%I A385487 #18 Aug 09 2025 14:42:22
%S A385487 3,7,29,65,69,81,257,259,4097,4113,4129,262145,262149,1048577,1048583,
%T A385487 16777217,16777219,38347927,214748365,214748369,4294967297,4294967299,
%U A385487 68719476737,68719476769,1099511627777,4398046511105,4398046511109
%N A385487 Records in A385485.
%H A385487 Chai Wah Wu, <a href="/A385487/b385487.txt">Table of n, a(n) for n = 1..27</a>
%F A385487 a(n) = A385485(A385486(n)).
%t A385487 f[n_] := Module[{m = n, k = 1}, While[Divisible[m, DigitSum[m, 2]], m += 2*n; k += 2]; k];
%t A385487 seq[lim_] := Module[{s = {}, fm = -1, fi}, Do[fi = f[i]; If[fi > fm, fm = fi; AppendTo[s, fi]], {i, 1, lim}]; s]; seq[10^4]
%o A385487 (PARI) f(n) = {my(m = n, k = 1); while(!(m % hammingweight(m)), m += 2*n; k += 2); k;}
%o A385487 list(lim) = my(fm = -1, fi); for(i = 1, lim, fi = f(i); if(fi > fm, fm = fi; print1(fi, ", ")));
%Y A385487 Cf. A049445, A144375 (decimal analog), A385484, A385485, A385486 (indices of records).
%K A385487 nonn,base,more
%O A385487 1,1
%A A385487 _Amiram Eldar_, Jun 30 2025
%E A385487 a(21)-a(27) from _Chai Wah Wu_, Jul 02 2025