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.

A331465 a(n) begins the first run of exactly n consecutive binary Smith numbers (A278909).

Original entry on oeis.org

15, 1390, 1369, 11763, 47802, 1529690, 4628217, 1544053, 804607562, 4747704789
Offset: 1

Views

Author

Amiram Eldar, Jan 17 2020

Keywords

Comments

a(11) > 5*10^10.

Examples

			a(2) = 1390 since 1390 and 1391 are binary Smith numbers.
a(3) = 1369 since 1369, 1370, and 1371 are binary Smith numbers.
		

Crossrefs

Programs

  • Mathematica
    binWt[n_] := Total@IntegerDigits[n, 2]; binSmithQ[n_] := CompositeQ[n] && Plus @@ (Last@# * binWt[ First@# ] & /@ FactorInteger[n]) == binWt[n]; n = 1; count = 0; max = 6; seq = Table[0, {max}]; While[count < max, n1 = n; If[binSmithQ[n], While[binSmithQ[++n1]]; d = n1 - n; If[d <= max && seq[[d]] == 0, count++; seq[[d]] = n]]; n = n1 + 1]; seq