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 A212223 #40 Dec 26 2024 13:31:40
%S A212223 2,6,6,882,1386,2007986541,70911040973874056146188543
%N A212223 a(n) is the least integer greater than 1 whose expansion in prime bases 2 to prime(n) have equal sum of digits.
%C A212223 Case a(1) is trivial since only base prime(1)=2 is involved.
%C A212223 Conjecture: the sequence never terminates.
%C A212223 a(7) > 2.3*10^16, if it exists. - _Giovanni Resta_, Oct 29 2018
%C A212223 Based on a search for the next term of A345296, a(8) is larger than 2.1*10^28. - _Thomas König_, Dec 15 2024
%e A212223 a(5) = 1386 because that number has the same sum of digits in the first 5 prime bases 2, 3, 5, 7, 11 (see A212222 and A000040).
%t A212223 f[n_] := Block[{p = Prime@ Range@ n, k = 2}, While[ Length[ Union[ Total@# & /@ IntegerDigits[k, p]]] != 1, k++]; k] (* _Robert G. Wilson v_, Oct 24 2014 *)
%o A212223 (PARI) isok(n, k) = my(s=hammingweight(k)); forprime (b=3, prime(n), if (sumdigits(k, b) != s, return (0))); return (1);
%o A212223 a(n) = my(k=2); while (!isok(n, k), k++); k; \\ _Michel Marcus_, Jun 08 2021
%Y A212223 Cf. A000040, A212222, A135127, A135121, A037301, A335839, A345296.
%K A212223 nonn,base,hard,more
%O A212223 1,1
%A A212223 _Stanislav Sykora_, May 10 2012
%E A212223 Name edited by _Michel Marcus_, Sep 14 2020
%E A212223 a(7) from _Thomas König_, Jun 08 2021