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.
%I A339081 #14 Feb 16 2025 08:34:01
%S A339081 2,11,103,167,941,6287,6287,150287,866087,4813583,53376151,80522263,
%T A339081 564779279,1300664983,1786616407,1971072527,4149916763,133076127097,
%U A339081 515655598279,4572291787807,4572291787807,4572291787807,9039081952627,189984035976239
%N A339081 Initial prime in the least binary Ormiston n-tuple: n consecutive primes whose binary representations are anagrams of each other.
%C A339081 Equivalently, a(n) is the start of the least run of n consecutive primes with the same length of binary representation (A070939) and the same binary weight (A000120).
%H A339081 Jens Kruse Andersen, <a href="http://primerecords.dk/ormiston_tuples.htm">Ormiston Tuples</a>.
%H A339081 Andy Edwards, <a href="https://web.archive.org/web/20200410180154if_/https://aamt.edu.au/content/download/742/19588/file/amt-s.pdf">Ormiston Pairs</a>, Australian Mathematics Teacher, Vol. 58, No. 2 (2002), pp. 12-13.
%H A339081 Giovanni Resta, <a href="https://www.numbersaplenty.com/set/Ormiston_pair">Ormiston pairs</a>.
%H A339081 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RearrangementPrimePair.html">Rearrangement Prime Pair</a>.
%e A339081 a(1) = 2 since 2 is the least prime number and its binary representation, 10, is not an anagram of the binary representation of the next prime, 3, whose binary representation is 11.
%e A339081 a(2) = 11 since 11 and 13 are the least pair of consecutive primes whose binary representations, 1011 and 1101, are anagrams of each other.
%e A339081 a(3) = 103 since 103, 107 and 109 are the least triple of consecutive primes whose binary representations, 1100111, 1101011 and 1101101, are anagrams of each other.
%t A339081 s[n_] := Sort[IntegerDigits[n, 2]]; orm[mx_] := Module[{p1 = p2 = 2, c = 1, m = 0, seq, s1, s2}, s1 = s[p1]; seq = Table[0, {mx}]; seq[[1]] = p1; While[c < mx, p2 = NextPrime[p2]; If[(s2 = s[p2]) == s1, c++; If[seq[[c]] == 0, seq[[c]] = p1], c = 1; p1 = p2; s1 = s2]]; seq]; orm[10]
%Y A339081 Cf. A217372 (decimal analog), A339080.
%K A339081 nonn,base,more
%O A339081 1,1
%A A339081 _Amiram Eldar_, Nov 22 2020
%E A339081 a(20)-a(24) from _Martin Ehrenstein_ using Kim Walisch's primesieve, Jan 31 2021