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 A379208 #26 Jan 19 2025 00:36:42 %S A379208 9,19,24,26,39,48,73,77,79,91,99,110,126,143,163,188,197,200,209,212, %T A379208 219,224,237,241,247,252,262,269,278,279,281,285,290,291,316,336,355, %U A379208 360,365,391,403,405,408,431,434,439,442,448,464,468,477,486,507,517,524,531,539,544,549,550,551,575,589,602,615 %N A379208 Numbers k such that prime(k) and prime(k) + 9 are anagrams. %H A379208 Robert Israel, <a href="/A379208/b379208.txt">Table of n, a(n) for n = 1..10000</a> %e A379208 9 is a term of the sequence because prime(9) = 23 and 23 + 9 = 32 are anagrams. %p A379208 filter:= proc(k) local p; %p A379208 p:= ithprime(k); %p A379208 sort(convert(p,base,10)) = sort(convert(p+9,base,10)) %p A379208 end proc: %p A379208 select(filter, [$1..1000]); # _Robert Israel_, Jan 18 2025 %t A379208 Select[Range[3000],Sort[IntegerDigits[Prime[#]]]==Sort[IntegerDigits[Prime[#]+9]]&] %o A379208 (Magma) [n: n in [0..2000] | Sort(Intseq(NthPrime(n))) eq Sort(Intseq(NthPrime(n) + 9))]; %o A379208 (PARI) is(n) = my(p = prime(n)); vecsort(digits(p)) == vecsort(digits(p+9)) \\ _David A. Corneth_, Dec 18 2024 %Y A379208 Cf. A140353, A228157. %K A379208 nonn,base %O A379208 1,1 %A A379208 _Vincenzo Librandi_, Dec 18 2024 %E A379208 Name corrected by _David A. Corneth_, Dec 18 2024