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.

A385483 Where records occur in A385482.

This page as a plain text file.
%I A385483 #8 Jul 01 2025 01:10:47
%S A385483 1,3,7,11,13,19,103,391,1811,3589,5147,6683,21883,46159,64133,149839,
%T A385483 151013,318377,650543,1279211,42559939,43120271,55201423,198069181,
%U A385483 265237811,929670011,930260173,1879562281,3320654641,5390681357,52883996713,78842843063,250434427519
%N A385483 Where records occur in A385482.
%H A385483 Amiram Eldar, <a href="/A385483/b385483.txt">Table of n, a(n) for n = 1..40</a>
%F A385483 A385482(a(n)) = A385484(n).
%t A385483 f[n_] := Module[{m = n, k = 1}, While[!Divisible[m, DigitSum[m, 2]], m += n; k++]; k];
%t A385483 seq[lim_] := Module[{s = {}, fm = -1, fi}, Do[fi = f[i]; If[fi > fm, fm = fi; AppendTo[s, i]], {i, 1, lim}]; s]; seq[10^4]
%o A385483 (PARI) f(n) = {my(m = n, k = 1); while(m % hammingweight(m), m += n; k++); k;}
%o A385483 list(lim) = my(fm = -1, fi); for(i = 1, lim, fi = f(i); if(fi > fm, fm = fi; print1(i, ", ")));
%Y A385483 Cf. A049445, A144364 (decimal analog), A385482, A385484 (record values), A385486.
%K A385483 nonn,base
%O A385483 1,2
%A A385483 _Amiram Eldar_, Jun 30 2025